/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-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:49:09,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:49:09,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:49:09,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:49:09,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:49:09,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:49:09,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:49:09,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:49:09,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:49:09,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:49:09,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:49:09,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:49:09,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:49:09,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:49:09,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:49:09,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:49:09,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:49:09,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:49:09,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:49:09,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:49:09,706 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:49:09,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:49:09,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:49:09,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:49:09,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:49:09,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:49:09,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:49:09,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:49:09,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:49:09,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:49:09,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:49:09,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:49:09,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:49:09,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:49:09,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:49:09,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:49:09,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:49:09,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:49:09,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:49:09,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:49:09,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:49:09,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:49:09,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:49:09,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:49:09,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:49:09,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:49:09,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:49:09,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:49:09,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:49:09,764 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:49:09,764 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:49:09,765 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:49:09,765 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:49:09,765 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:49:09,765 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:49:09,766 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:49:09,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:49:09,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:49:09,766 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:49:09,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:49:09,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:49:09,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:49:09,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:49:09,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:49:09,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:49:09,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:49:09,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:49:09,769 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:49:09,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:49:09,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:49:09,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:49:09,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:49:09,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:49:09,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:49:09,771 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:49:09,772 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:49:09,773 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:49:10,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:49:10,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:49:10,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:49:10,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:49:10,190 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:49:10,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-07-22 12:49:10,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d9e1d26/96facfacb0a246c687bcd73abdafd35d/FLAGdfb4b46ac [2022-07-22 12:49:10,866 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:49:10,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-07-22 12:49:10,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d9e1d26/96facfacb0a246c687bcd73abdafd35d/FLAGdfb4b46ac [2022-07-22 12:49:10,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d9e1d26/96facfacb0a246c687bcd73abdafd35d [2022-07-22 12:49:10,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:49:10,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:49:10,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:49:10,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:49:10,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:49:10,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:49:10" (1/1) ... [2022-07-22 12:49:10,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7436dae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:10, skipping insertion in model container [2022-07-22 12:49:10,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:49:10" (1/1) ... [2022-07-22 12:49:10,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:49:10,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:49:11,140 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-dec-subseq.wvr.c[2924,2937] [2022-07-22 12:49:11,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:49:11,155 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:49:11,181 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-dec-subseq.wvr.c[2924,2937] [2022-07-22 12:49:11,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:49:11,201 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:49:11,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11 WrapperNode [2022-07-22 12:49:11,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:49:11,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:49:11,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:49:11,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:49:11,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,256 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 186 [2022-07-22 12:49:11,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:49:11,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:49:11,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:49:11,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:49:11,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:49:11,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:49:11,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:49:11,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:49:11,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (1/1) ... [2022-07-22 12:49:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:11,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:11,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:11,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:49:11,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:49:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:49:11,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:49:11,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:49:11,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:49:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:49:11,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:49:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:49:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:49:11,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:49:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:49:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:49:11,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:49:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:49:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:49:11,436 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:49:11,587 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:49:11,590 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:49:12,026 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:49:12,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:49:12,164 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:49:12,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:49:12 BoogieIcfgContainer [2022-07-22 12:49:12,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:49:12,172 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:49:12,172 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:49:12,176 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:49:12,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:49:12,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:49:10" (1/3) ... [2022-07-22 12:49:12,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ed3097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:49:12, skipping insertion in model container [2022-07-22 12:49:12,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:49:12,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:11" (2/3) ... [2022-07-22 12:49:12,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ed3097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:49:12, skipping insertion in model container [2022-07-22 12:49:12,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:49:12,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:49:12" (3/3) ... [2022-07-22 12:49:12,181 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-07-22 12:49:12,285 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:49:12,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 386 flow [2022-07-22 12:49:12,437 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-22 12:49:12,437 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:49:12,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 15/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2022-07-22 12:49:12,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 386 flow [2022-07-22 12:49:12,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:12,457 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:49:12,468 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:12,471 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:12,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:12,545 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-22 12:49:12,551 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:49:12,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 15/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2022-07-22 12:49:12,556 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-07-22 12:49:18,548 INFO L131 LiptonReduction]: Checked pairs total: 1324 [2022-07-22 12:49:18,549 INFO L133 LiptonReduction]: Total number of compositions: 194 [2022-07-22 12:49:18,572 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:49:18,572 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:49:18,572 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:49:18,572 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:49:18,572 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:49:18,573 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:49:18,573 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:49:18,573 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:49:18,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:49:18,625 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-22 12:49:18,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:18,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:18,632 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:49:18,632 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:49:18,632 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:49:18,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 73 states, but on-demand construction may add more states [2022-07-22 12:49:18,641 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-22 12:49:18,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:18,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:18,641 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:49:18,641 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:49:18,647 INFO L748 eck$LassoCheckResult]: Stem: 178#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 181#[L117-6]don't care [2022-07-22 12:49:18,647 INFO L750 eck$LassoCheckResult]: Loop: 181#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 181#[L117-6]don't care [2022-07-22 12:49:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 772, now seen corresponding path program 1 times [2022-07-22 12:49:18,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:18,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344442289] [2022-07-22 12:49:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:18,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:18,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 734, now seen corresponding path program 1 times [2022-07-22 12:49:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709125087] [2022-07-22 12:49:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:18,906 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:18,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 24635, now seen corresponding path program 1 times [2022-07-22 12:49:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042808482] [2022-07-22 12:49:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:18,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:19,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:19,857 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:19,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:19,858 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:19,858 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:19,858 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:19,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:19,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:19,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:19,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:49:19,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:19,859 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:19,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:19,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:19,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:19,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:19,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:19,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:19,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:20,765 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:49:20,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:49:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:20,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:20,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:49:20,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:20,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:20,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:20,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:20,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:20,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:20,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:20,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:20,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:20,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:20,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:20,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:20,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:20,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:20,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:20,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:20,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:20,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:20,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:49:20,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:20,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:20,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:20,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:20,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:20,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:20,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:20,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:20,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:20,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:20,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:20,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:49:20,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:49:21,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:49:21,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:21,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:21,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:21,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:49:21,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,206 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:49:21,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,216 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:49:21,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,220 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:49:21,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,276 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:49:21,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:49:21,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:49:21,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:49:21,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:21,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:21,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:21,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:21,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:49:21,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:21,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 12:49:21,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,568 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:49:21,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:21,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:21,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:21,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:21,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:21,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:21,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:21,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:49:21,653 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:49:21,653 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:49:21,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:21,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:21,656 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:21,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:49:21,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:49:21,716 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:49:21,716 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:49:21,717 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2022-07-22 12:49:21,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 12:49:21,844 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:49:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:21,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:21,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:21,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:49:21,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:21,978 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:49:21,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 73 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:22,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 73 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 76 states and 182 transitions. Complement of second has 3 states. [2022-07-22 12:49:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:49:22,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:49:22,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:22,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:49:22,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:22,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:49:22,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:22,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 182 transitions. [2022-07-22 12:49:22,044 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-22 12:49:22,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 70 states and 171 transitions. [2022-07-22 12:49:22,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-22 12:49:22,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-22 12:49:22,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-22 12:49:22,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:22,056 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-22 12:49:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-22 12:49:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.449275362318841) internal successors, (169), 68 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-07-22 12:49:22,092 INFO L242 hiAutomatonCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-22 12:49:22,092 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-22 12:49:22,092 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:49:22,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 169 transitions. [2022-07-22 12:49:22,094 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-22 12:49:22,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:22,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:22,095 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:49:22,095 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:49:22,096 INFO L748 eck$LassoCheckResult]: Stem: 617#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 603#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 593#[L117-14]don't care [2022-07-22 12:49:22,096 INFO L750 eck$LassoCheckResult]: Loop: 593#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 593#[L117-14]don't care [2022-07-22 12:49:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash 24670, now seen corresponding path program 1 times [2022-07-22 12:49:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:22,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405278533] [2022-07-22 12:49:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:22,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:22,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 726, now seen corresponding path program 1 times [2022-07-22 12:49:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:22,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122088109] [2022-07-22 12:49:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:22,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:22,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 765465, now seen corresponding path program 1 times [2022-07-22 12:49:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:22,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567416041] [2022-07-22 12:49:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:22,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:22,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:23,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 12:49:23,946 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:23,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:23,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:23,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:23,946 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:23,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:23,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:23,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:23,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:49:23,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:23,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:23,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:23,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:24,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:49:24,916 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:49:24,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:24,919 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:24,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:49:24,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:24,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:24,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:24,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:24,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:24,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:24,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:24,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:24,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:24,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:24,992 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:24,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:49:25,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,066 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:49:25,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:49:25,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,181 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:49:25,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,250 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:49:25,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,317 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,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-22 12:49:25,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:49:25,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 12:49:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,370 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:49:25,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,437 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:49:25,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:49:25,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,475 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:49:25,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,507 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:49:25,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,548 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:49:25,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,606 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:49:25,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,668 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-22 12:49:25,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,669 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:49:25,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,702 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:49:25,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,739 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:49:25,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:49:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,773 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:49:25,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-22 12:49:25,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:49:25,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,827 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:49:25,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,874 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:49:25,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:49:25,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,911 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:49:25,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:25,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:25,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:25,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:25,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:25,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:25,982 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:25,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:25,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:25,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:25,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:25,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:25,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:25,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:25,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:25,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:49:26,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,042 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:49:26,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:26,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:26,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:26,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:49:26,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,075 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:49:26,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,116 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:49:26,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,152 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:49:26,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:26,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:26,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:26,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,186 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:49:26,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:26,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:26,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:26,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 12:49:26,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,221 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:49:26,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:49:26,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,259 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:49:26,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:26,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:26,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:26,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 12:49:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,291 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:49:26,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:49:26,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,326 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:49:26,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 12:49:26,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,364 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:49:26,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:49:26,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,410 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:49:26,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:49:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,447 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:49:26,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,483 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 12:49:26,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,537 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 12:49:26,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 12:49:26,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,574 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:49:26,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,583 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:49:26,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,587 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:49:26,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,622 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:49:26,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:26,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:26,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,686 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:26,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:49:26,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:26,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:26,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:26,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:26,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:26,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:26,718 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:49:26,742 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:49:26,743 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:49:26,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:26,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:26,744 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:26,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:49:26,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:49:26,772 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:49:26,772 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:49:26,772 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:49:26,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:49:26,870 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:49:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:26,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:26,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:49:26,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:26,919 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:49:26,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 169 transitions. cyclomatic complexity: 114 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:26,940 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 169 transitions. cyclomatic complexity: 114. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 70 states and 171 transitions. Complement of second has 3 states. [2022-07-22 12:49:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:49:26,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:49:26,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:26,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:49:26,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:49:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:26,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 171 transitions. [2022-07-22 12:49:26,945 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:26,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 171 transitions. [2022-07-22 12:49:26,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-22 12:49:26,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 12:49:26,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-22 12:49:26,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:26,948 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-22 12:49:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-22 12:49:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.442857142857143) internal successors, (171), 69 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 171 transitions. [2022-07-22 12:49:26,956 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:26,956 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:26,957 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:49:26,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 171 transitions. [2022-07-22 12:49:26,958 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:26,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:26,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:26,959 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:49:26,959 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:26,960 INFO L748 eck$LassoCheckResult]: Stem: 932#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 918#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 906#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 812#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 814#[L59, L101-4]don't care [2022-07-22 12:49:26,960 INFO L750 eck$LassoCheckResult]: Loop: 814#[L59, L101-4]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 820#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 814#[L59, L101-4]don't care [2022-07-22 12:49:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash 23731352, now seen corresponding path program 1 times [2022-07-22 12:49:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:26,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118404149] [2022-07-22 12:49:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:27,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:27,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118404149] [2022-07-22 12:49:27,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118404149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:27,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:27,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:49:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410001379] [2022-07-22 12:49:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:27,058 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:49:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 1 times [2022-07-22 12:49:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447358648] [2022-07-22 12:49:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,069 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:27,082 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-22 12:49:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:49:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:49:27,125 INFO L87 Difference]: Start difference. First operand 70 states and 171 transitions. cyclomatic complexity: 115 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:27,191 INFO L93 Difference]: Finished difference Result 70 states and 170 transitions. [2022-07-22 12:49:27,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 170 transitions. [2022-07-22 12:49:27,195 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:27,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 170 transitions. [2022-07-22 12:49:27,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-22 12:49:27,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 12:49:27,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 170 transitions. [2022-07-22 12:49:27,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:27,203 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-22 12:49:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 170 transitions. [2022-07-22 12:49:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-22 12:49:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 69 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 170 transitions. [2022-07-22 12:49:27,219 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-22 12:49:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:49:27,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-22 12:49:27,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:49:27,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 170 transitions. [2022-07-22 12:49:27,223 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:27,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:27,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:27,224 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:49:27,224 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:27,225 INFO L748 eck$LassoCheckResult]: Stem: 1148#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1134#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1124#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1126#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1022#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1024#[L59, L101-4]don't care [2022-07-22 12:49:27,225 INFO L750 eck$LassoCheckResult]: Loop: 1024#[L59, L101-4]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1036#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 1024#[L59, L101-4]don't care [2022-07-22 12:49:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,226 INFO L85 PathProgramCache]: Analyzing trace with hash 735635347, now seen corresponding path program 1 times [2022-07-22 12:49:27,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252845701] [2022-07-22 12:49:27,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 2 times [2022-07-22 12:49:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161010316] [2022-07-22 12:49:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1724014598, now seen corresponding path program 1 times [2022-07-22 12:49:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221265870] [2022-07-22 12:49:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:27,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221265870] [2022-07-22 12:49:27,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221265870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:27,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:27,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:49:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152246713] [2022-07-22 12:49:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:49:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:49:27,542 INFO L87 Difference]: Start difference. First operand 70 states and 170 transitions. cyclomatic complexity: 114 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:27,678 INFO L93 Difference]: Finished difference Result 133 states and 328 transitions. [2022-07-22 12:49:27,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 328 transitions. [2022-07-22 12:49:27,681 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 86 [2022-07-22 12:49:27,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 328 transitions. [2022-07-22 12:49:27,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-07-22 12:49:27,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-07-22 12:49:27,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 328 transitions. [2022-07-22 12:49:27,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:27,685 INFO L220 hiAutomatonCegarLoop]: Abstraction has 133 states and 328 transitions. [2022-07-22 12:49:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 328 transitions. [2022-07-22 12:49:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 71. [2022-07-22 12:49:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.436619718309859) internal successors, (173), 70 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 173 transitions. [2022-07-22 12:49:27,692 INFO L242 hiAutomatonCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-22 12:49:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:49:27,693 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-22 12:49:27,693 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:49:27,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 173 transitions. [2022-07-22 12:49:27,694 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:27,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:27,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:27,695 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:49:27,695 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:27,696 INFO L748 eck$LassoCheckResult]: Stem: 1437#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1423#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1411#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1413#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1315#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1317#[L59, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 1319#[L59, L102-3]don't care [2022-07-22 12:49:27,697 INFO L750 eck$LassoCheckResult]: Loop: 1319#[L59, L102-3]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_23| v_~last~0_16)) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31)))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1331#[L102-3, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 1319#[L59, L102-3]don't care [2022-07-22 12:49:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859971, now seen corresponding path program 1 times [2022-07-22 12:49:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603510556] [2022-07-22 12:49:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 3 times [2022-07-22 12:49:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109226896] [2022-07-22 12:49:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:27,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1904801302, now seen corresponding path program 1 times [2022-07-22 12:49:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:27,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118240563] [2022-07-22 12:49:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:27,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:27,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118240563] [2022-07-22 12:49:27,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118240563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:27,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:27,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:49:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900504911] [2022-07-22 12:49:27,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:27,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 12:49:27,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 12:49:27,990 INFO L87 Difference]: Start difference. First operand 71 states and 173 transitions. cyclomatic complexity: 116 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:28,119 INFO L93 Difference]: Finished difference Result 124 states and 297 transitions. [2022-07-22 12:49:28,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 297 transitions. [2022-07-22 12:49:28,122 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-22 12:49:28,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 297 transitions. [2022-07-22 12:49:28,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-07-22 12:49:28,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-07-22 12:49:28,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 297 transitions. [2022-07-22 12:49:28,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:28,125 INFO L220 hiAutomatonCegarLoop]: Abstraction has 124 states and 297 transitions. [2022-07-22 12:49:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 297 transitions. [2022-07-22 12:49:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2022-07-22 12:49:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.525) internal successors, (202), 79 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 202 transitions. [2022-07-22 12:49:28,131 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-22 12:49:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:49:28,133 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-22 12:49:28,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:49:28,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 202 transitions. [2022-07-22 12:49:28,134 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-22 12:49:28,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:28,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:28,134 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:49:28,134 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:28,135 INFO L748 eck$LassoCheckResult]: Stem: 1736#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1720#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1698#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1700#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1596#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1598#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1602#[L49-2, L101-4]don't care [2022-07-22 12:49:28,136 INFO L750 eck$LassoCheckResult]: Loop: 1602#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 1672#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1674#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 1606#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1602#[L49-2, L101-4]don't care [2022-07-22 12:49:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859928, now seen corresponding path program 1 times [2022-07-22 12:49:28,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585119160] [2022-07-22 12:49:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 1 times [2022-07-22 12:49:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:28,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718284124] [2022-07-22 12:49:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -899042998, now seen corresponding path program 1 times [2022-07-22 12:49:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404273212] [2022-07-22 12:49:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:28,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:28,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404273212] [2022-07-22 12:49:28,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404273212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:28,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:28,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:49:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267372930] [2022-07-22 12:49:28,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:49:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:49:28,448 INFO L87 Difference]: Start difference. First operand 80 states and 202 transitions. cyclomatic complexity: 138 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:28,521 INFO L93 Difference]: Finished difference Result 109 states and 250 transitions. [2022-07-22 12:49:28,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 250 transitions. [2022-07-22 12:49:28,522 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-22 12:49:28,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 80 states and 201 transitions. [2022-07-22 12:49:28,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-22 12:49:28,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:49:28,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 201 transitions. [2022-07-22 12:49:28,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:28,525 INFO L220 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-22 12:49:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 201 transitions. [2022-07-22 12:49:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-22 12:49:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.5125) internal successors, (201), 79 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 201 transitions. [2022-07-22 12:49:28,531 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-22 12:49:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:49:28,532 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-22 12:49:28,532 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:49:28,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 201 transitions. [2022-07-22 12:49:28,533 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-22 12:49:28,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:28,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:28,533 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:28,533 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:28,534 INFO L748 eck$LassoCheckResult]: Stem: 2014#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1998#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2000#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1978#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1980#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1868#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1870#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1880#[L49-2, L101-4]don't care [2022-07-22 12:49:28,535 INFO L750 eck$LassoCheckResult]: Loop: 1880#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 1942#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1944#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 1884#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1880#[L49-2, L101-4]don't care [2022-07-22 12:49:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1607490177, now seen corresponding path program 1 times [2022-07-22 12:49:28,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:28,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213034656] [2022-07-22 12:49:28,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 2 times [2022-07-22 12:49:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:28,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060397256] [2022-07-22 12:49:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:28,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -196525581, now seen corresponding path program 1 times [2022-07-22 12:49:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:28,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806622957] [2022-07-22 12:49:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:28,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806622957] [2022-07-22 12:49:28,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806622957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:49:28,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527355698] [2022-07-22 12:49:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:49:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:28,699 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-22 12:49:28,714 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-22 12:49:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:28,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:49:28,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:28,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:49:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:28,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527355698] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:49:28,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:49:28,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-07-22 12:49:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150136105] [2022-07-22 12:49:28,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:49:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:29,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 12:49:29,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-22 12:49:29,129 INFO L87 Difference]: Start difference. First operand 80 states and 201 transitions. cyclomatic complexity: 137 Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:29,574 INFO L93 Difference]: Finished difference Result 205 states and 473 transitions. [2022-07-22 12:49:29,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 473 transitions. [2022-07-22 12:49:29,577 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 118 [2022-07-22 12:49:29,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 195 states and 450 transitions. [2022-07-22 12:49:29,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2022-07-22 12:49:29,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2022-07-22 12:49:29,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 450 transitions. [2022-07-22 12:49:29,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:29,582 INFO L220 hiAutomatonCegarLoop]: Abstraction has 195 states and 450 transitions. [2022-07-22 12:49:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 450 transitions. [2022-07-22 12:49:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2022-07-22 12:49:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 2.5163934426229506) internal successors, (307), 121 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 307 transitions. [2022-07-22 12:49:29,590 INFO L242 hiAutomatonCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-22 12:49:29,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 12:49:29,591 INFO L425 stractBuchiCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-22 12:49:29,591 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:49:29,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 307 transitions. [2022-07-22 12:49:29,593 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-22 12:49:29,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:29,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:29,594 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:29,594 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:29,595 INFO L748 eck$LassoCheckResult]: Stem: 2488#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2452#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2454#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 2430#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2432#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2434#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2548#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 2524#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2484#[L49-2, L101-4]don't care [2022-07-22 12:49:29,609 INFO L750 eck$LassoCheckResult]: Loop: 2484#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 2396#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 2398#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 2344#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2484#[L49-2, L101-4]don't care [2022-07-22 12:49:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1708565110, now seen corresponding path program 2 times [2022-07-22 12:49:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:29,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935454949] [2022-07-22 12:49:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:29,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:29,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 3 times [2022-07-22 12:49:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:29,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040158139] [2022-07-22 12:49:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:29,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:29,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2065196932, now seen corresponding path program 2 times [2022-07-22 12:49:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:29,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937129299] [2022-07-22 12:49:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:29,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:29,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:32,752 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:32,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:32,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:32,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:32,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:32,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:32,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:32,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:32,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration8_Lasso [2022-07-22 12:49:32,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:32,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:32,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:34,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:35,191 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:49:35,192 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:49:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,195 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:49:35,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 12:49:35,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,230 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:49:35,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,264 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:49:35,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:49:35,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,297 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 12:49:35,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:49:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,332 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:49:35,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-22 12:49:35,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 12:49:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,367 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 12:49:35,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,427 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 12:49:35,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:49:35,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,480 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 12:49:35,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,539 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 12:49:35,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 12:49:35,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,572 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 12:49:35,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,618 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 12:49:35,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,653 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 12:49:35,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-22 12:49:35,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 12:49:35,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,686 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 12:49:35,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 12:49:35,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,720 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 12:49:35,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 12:49:35,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,756 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 12:49:35,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-22 12:49:35,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,812 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 12:49:35,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 12:49:35,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,847 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 12:49:35,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,892 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 12:49:35,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:35,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:35,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:35,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:49:35,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,925 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 12:49:35,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:35,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 12:49:35,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,961 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:35,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:35,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 12:49:35,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:35,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:35,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:35,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:35,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:35,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:35,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:36,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,001 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 12:49:36,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 12:49:36,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,039 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 12:49:36,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-22 12:49:36,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,075 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 12:49:36,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-22 12:49:36,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,113 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 12:49:36,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 12:49:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,148 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 12:49:36,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 12:49:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,183 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 12:49:36,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 12:49:36,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,218 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 12:49:36,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 12:49:36,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,265 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 12:49:36,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 12:49:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,312 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 12:49:36,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:49:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,350 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 12:49:36,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,387 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 12:49:36,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-22 12:49:36,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,423 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 12:49:36,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,433 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:49:36,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,438 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:49:36,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,483 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 12:49:36,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,522 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 12:49:36,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-22 12:49:36,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 12:49:36,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,556 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 12:49:36,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 12:49:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,592 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 12:49:36,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:36,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 12:49:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,634 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 12:49:36,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:36,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:36,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:36,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:36,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:36,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:36,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:36,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:49:36,744 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:49:36,744 INFO L444 ModelExtractionUtils]: 18 out of 52 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-22 12:49:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:36,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:36,747 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:36,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:49:36,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 12:49:36,772 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:49:36,772 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:49:36,773 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~end~0, ~n~0) = -1*~end~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:49:36,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-22 12:49:37,090 INFO L257 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2022-07-22 12:49:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:49:37,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:37,196 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:49:37,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:37,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 218 states and 529 transitions. Complement of second has 3 states. [2022-07-22 12:49:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 18 transitions. [2022-07-22 12:49:37,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:49:37,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:37,256 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:49:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:37,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:49:37,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:37,354 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:49:37,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:37,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 341 states and 858 transitions. Complement of second has 5 states. [2022-07-22 12:49:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-07-22 12:49:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:49:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-22 12:49:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-22 12:49:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:37,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 858 transitions. [2022-07-22 12:49:37,470 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 133 [2022-07-22 12:49:37,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 303 states and 762 transitions. [2022-07-22 12:49:37,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2022-07-22 12:49:37,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2022-07-22 12:49:37,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 762 transitions. [2022-07-22 12:49:37,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:49:37,478 INFO L220 hiAutomatonCegarLoop]: Abstraction has 303 states and 762 transitions. [2022-07-22 12:49:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 762 transitions. [2022-07-22 12:49:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 217. [2022-07-22 12:49:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 2.640552995391705) internal successors, (573), 216 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 573 transitions. [2022-07-22 12:49:37,501 INFO L242 hiAutomatonCegarLoop]: Abstraction has 217 states and 573 transitions. [2022-07-22 12:49:37,501 INFO L425 stractBuchiCegarLoop]: Abstraction has 217 states and 573 transitions. [2022-07-22 12:49:37,501 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:49:37,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 573 transitions. [2022-07-22 12:49:37,504 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 105 [2022-07-22 12:49:37,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:37,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:37,505 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:37,505 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:37,506 INFO L748 eck$LassoCheckResult]: Stem: 3705#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3659#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 3661#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 3611#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 3613#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3433#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 3435#[L59, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 3765#[L59, L102-3]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3835#[thread2ENTRY, L59, L102-4]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 3841#[L79, L59, L102-4]don't care [2022-07-22 12:49:37,506 INFO L750 eck$LassoCheckResult]: Loop: 3841#[L79, L59, L102-4]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~new~0_27 v_~v_old~0_16)) 1 0)) 0 1) v_~ok~0_16) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 3845#[L76, L59, L102-4]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 3841#[L79, L59, L102-4]don't care [2022-07-22 12:49:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1390107715, now seen corresponding path program 1 times [2022-07-22 12:49:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:37,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460141358] [2022-07-22 12:49:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:37,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 1 times [2022-07-22 12:49:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:37,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819776700] [2022-07-22 12:49:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:37,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash -158664463, now seen corresponding path program 1 times [2022-07-22 12:49:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:37,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965846729] [2022-07-22 12:49:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 12:49:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965846729] [2022-07-22 12:49:37,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965846729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:37,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:37,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:49:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061773753] [2022-07-22 12:49:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:38,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:49:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:49:38,040 INFO L87 Difference]: Start difference. First operand 217 states and 573 transitions. cyclomatic complexity: 401 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:38,102 INFO L93 Difference]: Finished difference Result 226 states and 566 transitions. [2022-07-22 12:49:38,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 566 transitions. [2022-07-22 12:49:38,106 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 93 [2022-07-22 12:49:38,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 216 states and 542 transitions. [2022-07-22 12:49:38,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2022-07-22 12:49:38,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2022-07-22 12:49:38,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 542 transitions. [2022-07-22 12:49:38,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:49:38,111 INFO L220 hiAutomatonCegarLoop]: Abstraction has 216 states and 542 transitions. [2022-07-22 12:49:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 542 transitions. [2022-07-22 12:49:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-07-22 12:49:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 214 states have (on average 2.5186915887850465) internal successors, (539), 213 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 539 transitions. [2022-07-22 12:49:38,124 INFO L242 hiAutomatonCegarLoop]: Abstraction has 214 states and 539 transitions. [2022-07-22 12:49:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:49:38,126 INFO L425 stractBuchiCegarLoop]: Abstraction has 214 states and 539 transitions. [2022-07-22 12:49:38,126 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:49:38,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 539 transitions. [2022-07-22 12:49:38,128 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 93 [2022-07-22 12:49:38,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:38,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:38,129 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:38,129 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:38,131 INFO L748 eck$LassoCheckResult]: Stem: 4373#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4327#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4329#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 4281#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4283#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4285#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4397#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 4393#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 4389#[L49-2, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 4391#[L102-3, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 4457#[L102-3, L54]don't care [2022-07-22 12:49:38,131 INFO L750 eck$LassoCheckResult]: Loop: 4457#[L102-3, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 4485#[L102-3, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 4479#[L59, L102-3]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 4361#[L102-3, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 4457#[L102-3, L54]don't care [2022-07-22 12:49:38,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1253541518, now seen corresponding path program 1 times [2022-07-22 12:49:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638896827] [2022-07-22 12:49:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash 18375887, now seen corresponding path program 4 times [2022-07-22 12:49:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75559857] [2022-07-22 12:49:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2118861376, now seen corresponding path program 1 times [2022-07-22 12:49:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102141775] [2022-07-22 12:49:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:49:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102141775] [2022-07-22 12:49:38,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102141775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:49:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122566523] [2022-07-22 12:49:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:49:38,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:38,343 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:49:38,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-07-22 12:49:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:38,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:49:38,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:49:38,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:49:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:49:38,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122566523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:49:38,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:49:38,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:49:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984896783] [2022-07-22 12:49:38,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:49:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:49:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:49:38,754 INFO L87 Difference]: Start difference. First operand 214 states and 539 transitions. cyclomatic complexity: 364 Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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-22 12:49:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:38,896 INFO L93 Difference]: Finished difference Result 428 states and 1050 transitions. [2022-07-22 12:49:38,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 1050 transitions. [2022-07-22 12:49:38,901 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 171 [2022-07-22 12:49:38,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 416 states and 1018 transitions. [2022-07-22 12:49:38,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2022-07-22 12:49:38,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2022-07-22 12:49:38,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 1018 transitions. [2022-07-22 12:49:38,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:49:38,907 INFO L220 hiAutomatonCegarLoop]: Abstraction has 416 states and 1018 transitions. [2022-07-22 12:49:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 1018 transitions. [2022-07-22 12:49:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 308. [2022-07-22 12:49:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 2.5454545454545454) internal successors, (784), 307 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 784 transitions. [2022-07-22 12:49:38,938 INFO L242 hiAutomatonCegarLoop]: Abstraction has 308 states and 784 transitions. [2022-07-22 12:49:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 12:49:38,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 308 states and 784 transitions. [2022-07-22 12:49:38,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:49:38,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 784 transitions. [2022-07-22 12:49:38,944 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 119 [2022-07-22 12:49:38,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:38,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:38,945 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:38,945 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:38,947 INFO L748 eck$LassoCheckResult]: Stem: 5368#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5300#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5302#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 5248#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5250#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |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~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~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_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, 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_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5052#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 5054#[L59, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 5156#[L59, L102-3]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 5158#[thread2ENTRY, L59, L102-4]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 5242#[L79, L59, L102-4]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_21| v_~last~0_14) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 5218#[L49-2, L79, L102-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 5038#[L79, L102-4, L54]don't care [2022-07-22 12:49:38,948 INFO L750 eck$LassoCheckResult]: Loop: 5038#[L79, L102-4, L54]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= (ite (= 0 (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~new~0_27 v_~v_old~0_16)) 1 0)) 0 1) v_~ok~0_16) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 5206#[L76, L102-4, L54]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 5038#[L79, L102-4, L54]don't care [2022-07-22 12:49:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -158664272, now seen corresponding path program 1 times [2022-07-22 12:49:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689641340] [2022-07-22 12:49:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:39,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 2 times [2022-07-22 12:49:39,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:39,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370369860] [2022-07-22 12:49:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:39,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:39,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2142477860, now seen corresponding path program 1 times [2022-07-22 12:49:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:39,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629637625] [2022-07-22 12:49:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:39,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:39,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:43,811 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:43,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:43,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:43,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:43,811 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:43,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:43,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:43,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:43,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration11_Lasso [2022-07-22 12:49:43,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:43,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:43,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:44,487 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:49:44,493 INFO L158 Benchmark]: Toolchain (without parser) took 33588.54ms. Allocated memory was 152.0MB in the beginning and 225.4MB in the end (delta: 73.4MB). Free memory was 126.4MB in the beginning and 123.5MB in the end (delta: 2.9MB). Peak memory consumption was 139.9MB. Max. memory is 8.0GB. [2022-07-22 12:49:44,493 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 152.0MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:49:44,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.98ms. Allocated memory is still 152.0MB. Free memory was 126.2MB in the beginning and 115.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:49:44,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.48ms. Allocated memory is still 152.0MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:49:44,494 INFO L158 Benchmark]: Boogie Preprocessor took 41.65ms. Allocated memory is still 152.0MB. Free memory was 112.8MB in the beginning and 111.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:49:44,495 INFO L158 Benchmark]: RCFGBuilder took 871.11ms. Allocated memory is still 152.0MB. Free memory was 111.2MB in the beginning and 122.2MB in the end (delta: -11.0MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-07-22 12:49:44,495 INFO L158 Benchmark]: BuchiAutomizer took 32320.29ms. Allocated memory was 152.0MB in the beginning and 225.4MB in the end (delta: 73.4MB). Free memory was 121.7MB in the beginning and 123.5MB in the end (delta: -1.9MB). Peak memory consumption was 136.0MB. Max. memory is 8.0GB. [2022-07-22 12:49:44,500 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.25ms. Allocated memory is still 152.0MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.98ms. Allocated memory is still 152.0MB. Free memory was 126.2MB in the beginning and 115.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.48ms. Allocated memory is still 152.0MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.65ms. Allocated memory is still 152.0MB. Free memory was 112.8MB in the beginning and 111.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 871.11ms. Allocated memory is still 152.0MB. Free memory was 111.2MB in the beginning and 122.2MB in the end (delta: -11.0MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 32320.29ms. Allocated memory was 152.0MB in the beginning and 225.4MB in the end (delta: 73.4MB). Free memory was 121.7MB in the beginning and 123.5MB in the end (delta: -1.9MB). Peak memory consumption was 136.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 173 PlacesBefore, 26 PlacesAfterwards, 181 TransitionsBefore, 24 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 132 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 6 ConcurrentYvCompositions, 10 ChoiceCompositions, 194 TotalNumberOfCompositions, 1324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 972, positive: 898, positive conditional: 0, positive unconditional: 898, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 391, positive: 375, positive conditional: 0, positive unconditional: 375, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 972, positive: 523, positive conditional: 0, positive unconditional: 523, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 391, unknown conditional: 0, unknown unconditional: 391] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:49:44,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:44,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:44,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...