/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:23:08,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:23:08,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:23:08,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:23:08,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:23:09,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:23:09,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:23:09,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:23:09,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:23:09,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:23:09,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:23:09,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:23:09,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:23:09,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:23:09,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:23:09,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:23:09,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:23:09,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:23:09,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:23:09,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:23:09,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:23:09,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:23:09,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:23:09,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:23:09,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:23:09,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:23:09,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:23:09,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:23:09,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:23:09,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:23:09,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:23:09,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:23:09,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:23:09,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:23:09,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:23:09,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:23:09,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:23:09,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:23:09,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:23:09,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:23:09,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:23:09,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:23:09,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:23:09,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:23:09,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:23:09,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:23:09,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:23:09,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:23:09,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:23:09,144 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:23:09,145 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:23:09,145 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:23:09,146 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:23:09,147 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:23:09,147 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:23:09,147 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:23:09,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:23:09,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:23:09,148 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:23:09,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:23:09,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:23:09,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:23:09,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:23:09,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:23:09,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:23:09,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:23:09,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:23:09,150 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:23:09,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:23:09,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:23:09,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:23:09,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:23:09,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:23:09,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:23:09,154 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:23:09,154 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:23:09,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:23:09,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:23:09,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:23:09,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:23:09,614 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:23:09,615 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:23:09,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5746e55c2/6f32201ebec3478fb07837f6ba29a7da/FLAGa77539533 [2022-07-22 12:23:10,282 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:23:10,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-07-22 12:23:10,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5746e55c2/6f32201ebec3478fb07837f6ba29a7da/FLAGa77539533 [2022-07-22 12:23:10,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5746e55c2/6f32201ebec3478fb07837f6ba29a7da [2022-07-22 12:23:10,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:23:10,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:23:10,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:23:10,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:23:10,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:23:10,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:10,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d562a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10, skipping insertion in model container [2022-07-22 12:23:10,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:10,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:23:10,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:23:10,857 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:23:10,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:23:10,874 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:23:10,903 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:23:10,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:23:10,925 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:23:10,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10 WrapperNode [2022-07-22 12:23:10,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:23:10,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:23:10,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:23:10,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:23:10,934 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:23:10" (1/1) ... [2022-07-22 12:23:10,945 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:23:10" (1/1) ... [2022-07-22 12:23:11,026 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 186 [2022-07-22 12:23:11,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:23:11,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:23:11,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:23:11,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:23:11,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:23:11,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:23:11,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:23:11,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:23:11,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (1/1) ... [2022-07-22 12:23:11,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:11,124 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:23:11,139 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:23:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:23:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:23:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:23:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:23:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:23:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:23:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:23:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:23:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:23:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:23:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:23:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:23:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:23:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:23:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:23:11,214 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:23:11,384 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:23:11,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:23:11,874 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:23:11,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:23:11,966 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:23:11,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:23:11 BoogieIcfgContainer [2022-07-22 12:23:11,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:23:11,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:23:11,974 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:23:11,978 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:23:11,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:23:11,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:23:10" (1/3) ... [2022-07-22 12:23:11,981 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d5a5ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:23:11, skipping insertion in model container [2022-07-22 12:23:11,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:23:11,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:10" (2/3) ... [2022-07-22 12:23:11,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d5a5ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:23:11, skipping insertion in model container [2022-07-22 12:23:11,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:23:11,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:23:11" (3/3) ... [2022-07-22 12:23:11,985 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-07-22 12:23:12,158 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:23:12,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 386 flow [2022-07-22 12:23:12,267 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-22 12:23:12,267 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:23:12,273 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:23:12,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 386 flow [2022-07-22 12:23:12,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 374 flow [2022-07-22 12:23:12,287 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:23:12,304 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-22 12:23:12,308 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-22 12:23:12,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 374 flow [2022-07-22 12:23:12,348 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-22 12:23:12,348 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:23:12,349 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:23:12,352 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-07-22 12:23:18,491 INFO L131 LiptonReduction]: Checked pairs total: 1138 [2022-07-22 12:23:18,491 INFO L133 LiptonReduction]: Total number of compositions: 194 [2022-07-22 12:23:18,516 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:23:18,516 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:23:18,517 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:23:18,517 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:23:18,517 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:23:18,517 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:23:18,517 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:23:18,517 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:23:18,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:23:18,565 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 46 [2022-07-22 12:23:18,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:18,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:18,572 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:23:18,573 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:18,573 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:23:18,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 59 states, but on-demand construction may add more states [2022-07-22 12:23:18,580 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 46 [2022-07-22 12:23:18,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:18,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:18,580 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:23:18,580 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:18,586 INFO L748 eck$LassoCheckResult]: Stem: 178#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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:23:18,587 INFO L750 eck$LassoCheckResult]: Loop: 181#[L117-6]don't care [704] 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_171| |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_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_162| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_162| |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_#memory_int_161|) (= |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_198|, #memory_int=|v_#memory_int_162|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_171|, 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_198|, #memory_int=|v_#memory_int_161|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_171|, 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:23:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash 772, now seen corresponding path program 1 times [2022-07-22 12:23:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:18,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594918468] [2022-07-22 12:23:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:18,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:18,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 735, now seen corresponding path program 1 times [2022-07-22 12:23:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:18,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881003721] [2022-07-22 12:23:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:18,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:18,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash 24636, now seen corresponding path program 1 times [2022-07-22 12:23:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:18,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070931236] [2022-07-22 12:23:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:18,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:18,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:18,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:19,929 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:19,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:19,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:19,930 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:19,931 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:19,931 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:19,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:19,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:19,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:23:19,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:19,932 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:19,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:23:19,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,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:23:19,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,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:23:19,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:23:19,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:23:19,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:19,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:23:19,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,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:23:20,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:23:20,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:20,904 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:23:20,910 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:23:20,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:20,915 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:23:20,928 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:23:20,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:20,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:20,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:20,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:20,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:20,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:20,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:20,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:20,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:23:20,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:20,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:20,995 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:23:21,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,008 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:23:21,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,062 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:23:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,064 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:23:21,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,088 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:23:21,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,137 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:23:21,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,139 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:23:21,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,157 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:23:21,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,199 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:23:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,202 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:23:21,209 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:23:21,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,243 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:23:21,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,245 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:23:21,248 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:23:21,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 12:23:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,287 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:23:21,288 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:23:21,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 12:23:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,334 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:23:21,336 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:23:21,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,376 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:23:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,379 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:23:21,379 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:23:21,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,438 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:23:21,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,440 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:23:21,441 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:23:21,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,509 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:23:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,511 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:23:21,513 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:23:21,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,570 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:23:21,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,571 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:23:21,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,594 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:23:21,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:21,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,644 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:23:21,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,667 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:23:21,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:21,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,697 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:23:21,699 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:23:21,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,731 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:23:21,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,732 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:23:21,733 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:23:21,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:23:21,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,781 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:23:21,782 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:23:21,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 12:23:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,842 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:23:21,846 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:23:21,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,879 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:23:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,881 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:23:21,882 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:23:21,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,914 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:23:21,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,916 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:23:21,918 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:23:21,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:21,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:21,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:23:21,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,955 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:23:21,959 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:23:21,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:21,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:21,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:21,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:21,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:21,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:21,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:21,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:21,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:21,990 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:23:21,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:21,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:21,992 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:23:21,993 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:23:21,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:22,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,028 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:23:22,029 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:23:22,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,060 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:23:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,062 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:23:22,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,065 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:23:22,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,095 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:23:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,096 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:23:22,097 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:23:22,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,131 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:23:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,132 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:23:22,133 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:23:22,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,187 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:23:22,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,188 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:23:22,190 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:23:22,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:23:22,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,227 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:23:22,228 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:23:22,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:22,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,262 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:23:22,262 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:23:22,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,297 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:23:22,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,298 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:23:22,299 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:23:22,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,348 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:23:22,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,349 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:23:22,350 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:23:22,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,380 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:23:22,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,382 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:23:22,386 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:23:22,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,421 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:23:22,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,422 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:23:22,443 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:23:22,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,473 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:23:22,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,474 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:23:22,476 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:23:22,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:22,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:22,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:22,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,506 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:23:22,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,508 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:23:22,508 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:23:22,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:23:22,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 12:23:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,543 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:23:22,544 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:23:22,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,582 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:23:22,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,584 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:23:22,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,585 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:23:22,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:22,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,631 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:23:22,634 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:23:22,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,641 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:23:22,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,645 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:23:22,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,687 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:23:22,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,688 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:23:22,689 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:23:22,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:23:22,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:22,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:23:22,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,726 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:23:22,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:22,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:22,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:22,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:22,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:22,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:22,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:22,746 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:23:22,760 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:23:22,824 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 12:23:22,824 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-22 12:23:22,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:22,834 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:23:22,857 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:23:22,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:23:22,878 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:23:22,879 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:23:22,880 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:23:22,936 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:23:22,988 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:23:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:23,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:23:23,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:23,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:23:23,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:23,061 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:23:23,099 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:23:23,102 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 59 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:23:23,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 59 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 62 states and 146 transitions. Complement of second has 3 states. [2022-07-22 12:23:23,166 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:23:23,175 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:23:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:23:23,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:23:23,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:23,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:23:23,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:23,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:23:23,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:23,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 146 transitions. [2022-07-22 12:23:23,193 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 45 [2022-07-22 12:23:23,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 135 transitions. [2022-07-22 12:23:23,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 12:23:23,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-07-22 12:23:23,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 135 transitions. [2022-07-22 12:23:23,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:23,213 INFO L220 hiAutomatonCegarLoop]: Abstraction has 56 states and 135 transitions. [2022-07-22 12:23:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 135 transitions. [2022-07-22 12:23:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-07-22 12:23:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.418181818181818) internal successors, (133), 54 states have internal predecessors, (133), 0 states have call successors, (0), 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:23:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 133 transitions. [2022-07-22 12:23:23,258 INFO L242 hiAutomatonCegarLoop]: Abstraction has 55 states and 133 transitions. [2022-07-22 12:23:23,258 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 133 transitions. [2022-07-22 12:23:23,258 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:23:23,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 133 transitions. [2022-07-22 12:23:23,264 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 45 [2022-07-22 12:23:23,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:23,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:23,265 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:23:23,265 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:23,266 INFO L748 eck$LassoCheckResult]: Stem: 547#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 533#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 527#[L117-14]don't care [2022-07-22 12:23:23,269 INFO L750 eck$LassoCheckResult]: Loop: 527#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 527#[L117-14]don't care [2022-07-22 12:23:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash 24671, now seen corresponding path program 1 times [2022-07-22 12:23:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:23,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035673758] [2022-07-22 12:23:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:23,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:23,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:23,391 INFO L85 PathProgramCache]: Analyzing trace with hash 726, now seen corresponding path program 1 times [2022-07-22 12:23:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:23,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574127339] [2022-07-22 12:23:23,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:23,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:23,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 765496, now seen corresponding path program 1 times [2022-07-22 12:23:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:23,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937656044] [2022-07-22 12:23:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:23,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:23,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:24,891 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:24,891 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:24,891 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:24,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:24,892 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:24,892 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:24,892 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:24,892 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:24,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:23:24,892 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:24,892 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:24,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:24,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:23:24,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:24,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:24,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:24,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:24,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:25,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,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:23:25,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,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:23:25,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:23:25,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:25,919 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:23:25,919 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:23:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:25,920 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:23:25,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:25,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:25,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:25,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:25,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:25,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:25,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:25,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:25,942 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:23:25,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:25,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:25,989 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:23:25,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,005 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:23:26,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,032 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:23:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,034 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:23:26,035 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:23:26,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,069 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:23:26,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,070 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:23:26,071 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:23:26,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:26,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:26,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:26,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:26,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,103 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:23:26,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,107 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:23:26,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:26,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:26,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:26,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:26,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,173 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:23:26,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,185 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:23:26,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,190 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:23:26,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,200 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:23:26,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:26,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,239 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:23:26,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,260 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:23:26,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,303 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:23:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,305 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:23:26,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,320 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:23:26,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,362 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:23:26,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,364 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:23:26,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,375 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:23:26,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,425 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:23:26,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,437 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:23:26,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,487 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:23:26,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,488 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:23:26,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,509 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:23:26,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,551 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:23:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,553 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:23:26,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,569 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:23:26,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,598 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:23:26,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,599 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:23:26,600 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:23:26,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:26,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:26,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:26,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,633 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:23:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,635 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:26,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:23:26,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-22 12:23:26,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,670 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:23:26,671 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:23:26,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:23:26,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,749 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:23:26,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,750 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:23:26,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,769 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:23:26,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,810 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:23:26,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,811 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:23:26,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:23:26,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,827 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:23:26,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:26,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,870 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:23:26,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:26,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:26,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:26,882 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:23:26,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,912 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:23:26,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,913 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:23:26,914 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:23:26,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:26,948 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:23:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,949 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:23:26,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:26,954 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:23:26,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:26,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:26,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:26,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:26,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:26,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:26,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:23:26,992 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:23:26,992 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:23:26,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:26,995 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:23:26,999 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:23:27,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:23:27,008 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:23:27,008 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:23:27,008 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:23:27,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 12:23:27,126 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:23:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:27,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:27,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:23:27,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:27,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:23:27,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:27,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:23:27,196 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:23:27,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 133 transitions. cyclomatic complexity: 92 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:23:27,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 133 transitions. cyclomatic complexity: 92. 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 56 states and 135 transitions. Complement of second has 3 states. [2022-07-22 12:23:27,233 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:23:27,234 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:23:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:23:27,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:23:27,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:27,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:23:27,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:27,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:23:27,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:27,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 135 transitions. [2022-07-22 12:23:27,242 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 44 [2022-07-22 12:23:27,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 135 transitions. [2022-07-22 12:23:27,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-22 12:23:27,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 12:23:27,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 135 transitions. [2022-07-22 12:23:27,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:27,250 INFO L220 hiAutomatonCegarLoop]: Abstraction has 56 states and 135 transitions. [2022-07-22 12:23:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 135 transitions. [2022-07-22 12:23:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-22 12:23:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.4107142857142856) internal successors, (135), 55 states have internal predecessors, (135), 0 states have call successors, (0), 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:23:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 135 transitions. [2022-07-22 12:23:27,266 INFO L242 hiAutomatonCegarLoop]: Abstraction has 56 states and 135 transitions. [2022-07-22 12:23:27,266 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 135 transitions. [2022-07-22 12:23:27,266 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:23:27,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 135 transitions. [2022-07-22 12:23:27,269 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 44 [2022-07-22 12:23:27,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:27,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:27,270 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:23:27,270 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:23:27,271 INFO L748 eck$LassoCheckResult]: Stem: 820#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 806#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 798#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 722#[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] 724#[L59, L101-4]don't care [2022-07-22 12:23:27,271 INFO L750 eck$LassoCheckResult]: Loop: 724#[L59, L101-4]don't care [652] L59-->L49-4: Formula: (let ((.cse0 (* v_~i~0_71 4))) (let ((.cse1 (+ v_~A~0.offset_45 .cse0))) (and (<= (+ v_~A~0.offset_45 .cse0 4) (select |v_#length_101| v_~A~0.base_45)) (= (select |v_#valid_116| v_~A~0.base_45) 1) (<= 0 .cse1) (< v_~i~0_71 v_~N~0_33) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_27| (select (select |v_#memory_int_101| v_~A~0.base_45) .cse1)) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_27| v_~last~0_20))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~i~0=v_~i~0_71, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_101|, #length=|v_#length_101|, ~N~0=v_~N~0_33, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~i~0=v_~i~0_71, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_101|, #length=|v_#length_101|, ~N~0=v_~N~0_33, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 730#[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] 724#[L59, L101-4]don't care [2022-07-22 12:23:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 23732313, now seen corresponding path program 1 times [2022-07-22 12:23:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:27,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421296875] [2022-07-22 12:23:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:27,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:27,426 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:23:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421296875] [2022-07-22 12:23:27,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421296875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:27,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:27,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:23:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500612895] [2022-07-22 12:23:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:27,434 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:23:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 1 times [2022-07-22 12:23:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:27,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037364762] [2022-07-22 12:23:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:27,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:27,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:23:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:23:27,496 INFO L87 Difference]: Start difference. First operand 56 states and 135 transitions. cyclomatic complexity: 93 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:23:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:27,561 INFO L93 Difference]: Finished difference Result 56 states and 134 transitions. [2022-07-22 12:23:27,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 134 transitions. [2022-07-22 12:23:27,565 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 44 [2022-07-22 12:23:27,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 134 transitions. [2022-07-22 12:23:27,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 12:23:27,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 12:23:27,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 134 transitions. [2022-07-22 12:23:27,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:27,571 INFO L220 hiAutomatonCegarLoop]: Abstraction has 56 states and 134 transitions. [2022-07-22 12:23:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 134 transitions. [2022-07-22 12:23:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-22 12:23:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.392857142857143) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 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:23:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 134 transitions. [2022-07-22 12:23:27,583 INFO L242 hiAutomatonCegarLoop]: Abstraction has 56 states and 134 transitions. [2022-07-22 12:23:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:23:27,585 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 134 transitions. [2022-07-22 12:23:27,585 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:23:27,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 134 transitions. [2022-07-22 12:23:27,586 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 44 [2022-07-22 12:23:27,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:27,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:27,586 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:23:27,586 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:23:27,587 INFO L748 eck$LassoCheckResult]: Stem: 994#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 980#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 972#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 974#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 896#[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] 898#[L59, L101-4]don't care [2022-07-22 12:23:27,588 INFO L750 eck$LassoCheckResult]: Loop: 898#[L59, L101-4]don't care [652] L59-->L49-4: Formula: (let ((.cse0 (* v_~i~0_71 4))) (let ((.cse1 (+ v_~A~0.offset_45 .cse0))) (and (<= (+ v_~A~0.offset_45 .cse0 4) (select |v_#length_101| v_~A~0.base_45)) (= (select |v_#valid_116| v_~A~0.base_45) 1) (<= 0 .cse1) (< v_~i~0_71 v_~N~0_33) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_27| (select (select |v_#memory_int_101| v_~A~0.base_45) .cse1)) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_27| v_~last~0_20))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~i~0=v_~i~0_71, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_101|, #length=|v_#length_101|, ~N~0=v_~N~0_33, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~i~0=v_~i~0_71, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_101|, #length=|v_#length_101|, ~N~0=v_~N~0_33, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 904#[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] 898#[L59, L101-4]don't care [2022-07-22 12:23:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 735665138, now seen corresponding path program 1 times [2022-07-22 12:23:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:27,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330968177] [2022-07-22 12:23:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:27,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:27,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 2 times [2022-07-22 12:23:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562943297] [2022-07-22 12:23:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:27,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:27,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1695385447, now seen corresponding path program 1 times [2022-07-22 12:23:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:27,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678359674] [2022-07-22 12:23:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:27,813 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:23:27,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:27,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678359674] [2022-07-22 12:23:27,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678359674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:27,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:27,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:23:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96490577] [2022-07-22 12:23:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:23:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:23:27,851 INFO L87 Difference]: Start difference. First operand 56 states and 134 transitions. cyclomatic complexity: 92 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:23:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:27,990 INFO L93 Difference]: Finished difference Result 105 states and 256 transitions. [2022-07-22 12:23:27,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 256 transitions. [2022-07-22 12:23:27,992 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 58 [2022-07-22 12:23:27,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 256 transitions. [2022-07-22 12:23:27,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-07-22 12:23:27,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2022-07-22 12:23:27,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 256 transitions. [2022-07-22 12:23:27,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:27,996 INFO L220 hiAutomatonCegarLoop]: Abstraction has 105 states and 256 transitions. [2022-07-22 12:23:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 256 transitions. [2022-07-22 12:23:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 57. [2022-07-22 12:23:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 56 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 137 transitions. [2022-07-22 12:23:28,003 INFO L242 hiAutomatonCegarLoop]: Abstraction has 57 states and 137 transitions. [2022-07-22 12:23:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:23:28,004 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 137 transitions. [2022-07-22 12:23:28,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:23:28,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 137 transitions. [2022-07-22 12:23:28,007 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 44 [2022-07-22 12:23:28,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:28,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:28,008 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:23:28,008 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:23:28,013 INFO L748 eck$LassoCheckResult]: Stem: 1227#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 1213#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 1205#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 1207#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 1127#[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] 1129#[L59, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (select |v_#valid_184| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 4) (select |v_#length_157| |v_ULTIMATE.start_main_~#t2~0#1.base_53|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_47|) (= (store |v_#memory_int_152| |v_ULTIMATE.start_main_~#t2~0#1.base_53| (store (select |v_#memory_int_152| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre17#1_37|)) |v_#memory_int_151|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_37| |v_#pthreadsForks_52|)) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_152|, #length=|v_#length_157|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_151|, #length=|v_#length_157|, 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_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 1131#[L59, L102-3]don't care [2022-07-22 12:23:28,013 INFO L750 eck$LassoCheckResult]: Loop: 1131#[L59, L102-3]don't care [652] L59-->L49-4: Formula: (let ((.cse0 (* v_~i~0_71 4))) (let ((.cse1 (+ v_~A~0.offset_45 .cse0))) (and (<= (+ v_~A~0.offset_45 .cse0 4) (select |v_#length_101| v_~A~0.base_45)) (= (select |v_#valid_116| v_~A~0.base_45) 1) (<= 0 .cse1) (< v_~i~0_71 v_~N~0_33) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_27| (select (select |v_#memory_int_101| v_~A~0.base_45) .cse1)) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_27| v_~last~0_20))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~i~0=v_~i~0_71, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_101|, #length=|v_#length_101|, ~N~0=v_~N~0_33, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~i~0=v_~i~0_71, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_101|, #length=|v_#length_101|, ~N~0=v_~N~0_33, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1139#[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] 1131#[L59, L102-3]don't care [2022-07-22 12:23:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1330783492, now seen corresponding path program 1 times [2022-07-22 12:23:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77675122] [2022-07-22 12:23:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 3 times [2022-07-22 12:23:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361032779] [2022-07-22 12:23:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1017297621, now seen corresponding path program 1 times [2022-07-22 12:23:28,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975246733] [2022-07-22 12:23:28,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:28,213 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:23:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975246733] [2022-07-22 12:23:28,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975246733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:28,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:28,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:23:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532945060] [2022-07-22 12:23:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 12:23:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 12:23:28,251 INFO L87 Difference]: Start difference. First operand 57 states and 137 transitions. cyclomatic complexity: 94 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:23:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:28,378 INFO L93 Difference]: Finished difference Result 98 states and 232 transitions. [2022-07-22 12:23:28,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 232 transitions. [2022-07-22 12:23:28,381 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 56 [2022-07-22 12:23:28,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 232 transitions. [2022-07-22 12:23:28,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-22 12:23:28,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-22 12:23:28,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 232 transitions. [2022-07-22 12:23:28,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:28,385 INFO L220 hiAutomatonCegarLoop]: Abstraction has 98 states and 232 transitions. [2022-07-22 12:23:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 232 transitions. [2022-07-22 12:23:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2022-07-22 12:23:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.484375) internal successors, (159), 63 states have internal predecessors, (159), 0 states have call successors, (0), 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:23:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 159 transitions. [2022-07-22 12:23:28,392 INFO L242 hiAutomatonCegarLoop]: Abstraction has 64 states and 159 transitions. [2022-07-22 12:23:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:23:28,394 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 159 transitions. [2022-07-22 12:23:28,394 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:23:28,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 159 transitions. [2022-07-22 12:23:28,395 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 46 [2022-07-22 12:23:28,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:28,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:28,395 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:23:28,396 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:23:28,396 INFO L748 eck$LassoCheckResult]: Stem: 1468#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 1452#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 1438#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 1440#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 1354#[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] 1356#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1360#[L49-2, L101-4]don't care [2022-07-22 12:23:28,397 INFO L750 eck$LassoCheckResult]: Loop: 1360#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~end~0_69 4)) (.cse1 (* v_~i~0_51 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31)) (.cse3 (+ v_~queue~0.offset_35 .cse2))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (select |v_#valid_92| v_~A~0.base_31) 1) (= v_~end~0_68 (+ v_~end~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~end~0_69) (< v_~end~0_69 v_~n~0_34)) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_77| v_~A~0.base_31)) (<= (+ 4 v_~queue~0.offset_35 .cse2) (select |v_#length_77| v_~queue~0.base_35)) (<= 0 .cse3) (= (select |v_#valid_92| v_~queue~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_69| v_~A~0.base_31) .cse0) (select (select |v_#memory_int_69| v_~queue~0.base_35) .cse3)) 1 0))))) InVars {~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_51, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_69, #length=|v_#length_77|, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_34} OutVars{~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~i~0=v_~i~0_51, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_35, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_92|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_68, #length=|v_#length_77|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|, ~n~0=v_~n~0_34, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|} 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] 1416#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse1 (* v_~i~0_37 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_19))) (and (= (select |v_#valid_58| v_~A~0.base_19) 1) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_13| (select (select |v_#memory_int_51| v_~A~0.base_19) .cse0)) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_13|) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_19 4) (select |v_#length_51| v_~A~0.base_19))))) InVars {~A~0.base=v_~A~0.base_19, ~A~0.offset=v_~A~0.offset_19, ~i~0=v_~i~0_37, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_51|, #length=|v_#length_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, ~A~0.base=v_~A~0.base_19, ~A~0.offset=v_~A~0.offset_19, ~i~0=v_~i~0_37, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_51|, #length=|v_#length_51|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1418#[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] 1368#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1360#[L49-2, L101-4]don't care [2022-07-22 12:23:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1330783449, now seen corresponding path program 1 times [2022-07-22 12:23:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227526283] [2022-07-22 12:23:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 1 times [2022-07-22 12:23:28,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818273162] [2022-07-22 12:23:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1588469835, now seen corresponding path program 1 times [2022-07-22 12:23:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518654716] [2022-07-22 12:23:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:28,560 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:23:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:28,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518654716] [2022-07-22 12:23:28,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518654716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:28,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:28,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:23:28,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844186899] [2022-07-22 12:23:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:28,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:23:28,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:23:28,780 INFO L87 Difference]: Start difference. First operand 64 states and 159 transitions. cyclomatic complexity: 111 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:23:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:28,853 INFO L93 Difference]: Finished difference Result 93 states and 207 transitions. [2022-07-22 12:23:28,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 207 transitions. [2022-07-22 12:23:28,855 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 46 [2022-07-22 12:23:28,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 64 states and 158 transitions. [2022-07-22 12:23:28,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-07-22 12:23:28,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-22 12:23:28,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 158 transitions. [2022-07-22 12:23:28,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:28,858 INFO L220 hiAutomatonCegarLoop]: Abstraction has 64 states and 158 transitions. [2022-07-22 12:23:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 158 transitions. [2022-07-22 12:23:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-22 12:23:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.46875) internal successors, (158), 63 states have internal predecessors, (158), 0 states have call successors, (0), 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:23:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 158 transitions. [2022-07-22 12:23:28,863 INFO L242 hiAutomatonCegarLoop]: Abstraction has 64 states and 158 transitions. [2022-07-22 12:23:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:23:28,864 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 158 transitions. [2022-07-22 12:23:28,864 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:23:28,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 158 transitions. [2022-07-22 12:23:28,865 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 46 [2022-07-22 12:23:28,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:28,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:28,866 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:23:28,866 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:23:28,867 INFO L748 eck$LassoCheckResult]: Stem: 1698#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 1682#[L117-6]don't care [704] 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_171| |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_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_162| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_162| |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_#memory_int_161|) (= |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_198|, #memory_int=|v_#memory_int_162|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_171|, 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_198|, #memory_int=|v_#memory_int_161|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_171|, 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] 1684#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 1668#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 1670#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 1584#[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] 1586#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1590#[L49-2, L101-4]don't care [2022-07-22 12:23:28,867 INFO L750 eck$LassoCheckResult]: Loop: 1590#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~end~0_69 4)) (.cse1 (* v_~i~0_51 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31)) (.cse3 (+ v_~queue~0.offset_35 .cse2))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (select |v_#valid_92| v_~A~0.base_31) 1) (= v_~end~0_68 (+ v_~end~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~end~0_69) (< v_~end~0_69 v_~n~0_34)) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_77| v_~A~0.base_31)) (<= (+ 4 v_~queue~0.offset_35 .cse2) (select |v_#length_77| v_~queue~0.base_35)) (<= 0 .cse3) (= (select |v_#valid_92| v_~queue~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_69| v_~A~0.base_31) .cse0) (select (select |v_#memory_int_69| v_~queue~0.base_35) .cse3)) 1 0))))) InVars {~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_51, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_69, #length=|v_#length_77|, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_34} OutVars{~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~i~0=v_~i~0_51, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_35, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_92|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_68, #length=|v_#length_77|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|, ~n~0=v_~n~0_34, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|} 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] 1646#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse1 (* v_~i~0_37 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_19))) (and (= (select |v_#valid_58| v_~A~0.base_19) 1) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_13| (select (select |v_#memory_int_51| v_~A~0.base_19) .cse0)) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_13|) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_19 4) (select |v_#length_51| v_~A~0.base_19))))) InVars {~A~0.base=v_~A~0.base_19, ~A~0.offset=v_~A~0.offset_19, ~i~0=v_~i~0_37, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_51|, #length=|v_#length_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, ~A~0.base=v_~A~0.base_19, ~A~0.offset=v_~A~0.offset_19, ~i~0=v_~i~0_37, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_51|, #length=|v_#length_51|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1648#[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] 1598#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1590#[L49-2, L101-4]don't care [2022-07-22 12:23:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1637042849, now seen corresponding path program 1 times [2022-07-22 12:23:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395074194] [2022-07-22 12:23:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 2 times [2022-07-22 12:23:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197149641] [2022-07-22 12:23:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:28,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2094473747, now seen corresponding path program 1 times [2022-07-22 12:23:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:28,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041377715] [2022-07-22 12:23:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:29,029 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:23:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:29,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041377715] [2022-07-22 12:23:29,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041377715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:23:29,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614065842] [2022-07-22 12:23:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:29,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:23:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:29,032 INFO L229 MonitoredProcess]: Starting monitored process 63 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:23:29,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-07-22 12:23:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:29,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:23:29,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:29,200 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:23:29,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:23:29,260 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:23:29,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614065842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:23:29,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:23:29,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-07-22 12:23:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176857409] [2022-07-22 12:23:29,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:23:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 12:23:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-22 12:23:29,442 INFO L87 Difference]: Start difference. First operand 64 states and 158 transitions. cyclomatic complexity: 110 Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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:23:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:29,734 INFO L93 Difference]: Finished difference Result 160 states and 365 transitions. [2022-07-22 12:23:29,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 365 transitions. [2022-07-22 12:23:29,737 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 74 [2022-07-22 12:23:29,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 150 states and 342 transitions. [2022-07-22 12:23:29,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2022-07-22 12:23:29,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2022-07-22 12:23:29,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 342 transitions. [2022-07-22 12:23:29,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:29,742 INFO L220 hiAutomatonCegarLoop]: Abstraction has 150 states and 342 transitions. [2022-07-22 12:23:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 342 transitions. [2022-07-22 12:23:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 96. [2022-07-22 12:23:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 2.46875) internal successors, (237), 95 states have internal predecessors, (237), 0 states have call successors, (0), 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:23:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 237 transitions. [2022-07-22 12:23:29,749 INFO L242 hiAutomatonCegarLoop]: Abstraction has 96 states and 237 transitions. [2022-07-22 12:23:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 12:23:29,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 237 transitions. [2022-07-22 12:23:29,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:23:29,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 237 transitions. [2022-07-22 12:23:29,752 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 56 [2022-07-22 12:23:29,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:29,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:29,753 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:23:29,753 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:23:29,754 INFO L748 eck$LassoCheckResult]: Stem: 2088#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 2056#[L117-6]don't care [704] 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_171| |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_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_162| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_162| |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_#memory_int_161|) (= |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_198|, #memory_int=|v_#memory_int_162|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_171|, 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_198|, #memory_int=|v_#memory_int_161|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_171|, 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] 2058#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 2038#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 2040#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 2042#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 2044#[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] 2122#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2084#[L49-2, L101-4]don't care [2022-07-22 12:23:29,754 INFO L750 eck$LassoCheckResult]: Loop: 2084#[L49-2, L101-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~end~0_69 4)) (.cse1 (* v_~i~0_51 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31)) (.cse3 (+ v_~queue~0.offset_35 .cse2))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (select |v_#valid_92| v_~A~0.base_31) 1) (= v_~end~0_68 (+ v_~end~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~end~0_69) (< v_~end~0_69 v_~n~0_34)) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_77| v_~A~0.base_31)) (<= (+ 4 v_~queue~0.offset_35 .cse2) (select |v_#length_77| v_~queue~0.base_35)) (<= 0 .cse3) (= (select |v_#valid_92| v_~queue~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_69| v_~A~0.base_31) .cse0) (select (select |v_#memory_int_69| v_~queue~0.base_35) .cse3)) 1 0))))) InVars {~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_51, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_69, #length=|v_#length_77|, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_34} OutVars{~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~i~0=v_~i~0_51, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_35, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_92|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_68, #length=|v_#length_77|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|, ~n~0=v_~n~0_34, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|} 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] 2014#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse1 (* v_~i~0_37 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_19))) (and (= (select |v_#valid_58| v_~A~0.base_19) 1) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_13| (select (select |v_#memory_int_51| v_~A~0.base_19) .cse0)) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_13|) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_19 4) (select |v_#length_51| v_~A~0.base_19))))) InVars {~A~0.base=v_~A~0.base_19, ~A~0.offset=v_~A~0.offset_19, ~i~0=v_~i~0_37, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_51|, #length=|v_#length_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, ~A~0.base=v_~A~0.base_19, ~A~0.offset=v_~A~0.offset_19, ~i~0=v_~i~0_37, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_51|, #length=|v_#length_51|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 2016#[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] 1972#[L59, L101-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2084#[L49-2, L101-4]don't care [2022-07-22 12:23:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash -792432278, now seen corresponding path program 2 times [2022-07-22 12:23:29,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:29,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758423255] [2022-07-22 12:23:29,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:29,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:29,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 3 times [2022-07-22 12:23:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:29,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220852459] [2022-07-22 12:23:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:29,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:29,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 236305500, now seen corresponding path program 2 times [2022-07-22 12:23:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:29,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487942724] [2022-07-22 12:23:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:29,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:29,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:32,395 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:32,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:32,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:32,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:32,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:32,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:32,396 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:32,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:32,396 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration8_Lasso [2022-07-22 12:23:32,396 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:32,396 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:32,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,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:23:32,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,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:23:32,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:23:32,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:23:32,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:32,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,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:23:33,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:33,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:23:33,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:34,764 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:23:34,764 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:23:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,769 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:23:34,770 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:23:34,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:34,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:34,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:34,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:34,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,805 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:23:34,805 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:23:34,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:34,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:34,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:34,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:34,849 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:23:34,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,850 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:23:34,850 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:23:34,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:34,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:34,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:34,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:34,882 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:23:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,884 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:23:34,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:34,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:34,898 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:23:34,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:34,920 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:23:34,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,922 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:23:34,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,925 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:23:34,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:34,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:34,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:34,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:34,953 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:23:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,955 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:23:34,955 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:23:34,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:34,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:34,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:34,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:34,986 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:23:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:34,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:34,987 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:23:34,988 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:23:34,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:34,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:34,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:34,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:34,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:34,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:34,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,022 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:23:35,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,023 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:23:35,024 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:23:35,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,056 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:23:35,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,057 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:23:35,058 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:23:35,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,089 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:23:35,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,090 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:23:35,091 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:23:35,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,123 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:23:35,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,126 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:23:35,126 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:23:35,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,156 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:23:35,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,157 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:23:35,158 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:23:35,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:23:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,193 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:23:35,194 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:23:35,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:35,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,241 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:23:35,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,254 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:23:35,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,298 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:23: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:23:35,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,311 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:23:35,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,341 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:23:35,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,343 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:23:35,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:23:35,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,360 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:23:35,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,386 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:23:35,387 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:23:35,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,417 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:23:35,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,418 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:23:35,420 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:23:35,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,452 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:23:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,454 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:23:35,454 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:23:35,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,485 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:23:35,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,487 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:23:35,493 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:23:35,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:35,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,523 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:23:35,524 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:23:35,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,554 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:23:35,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,556 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:23:35,556 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:23:35,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:23:35,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,589 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:23:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,591 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:23:35,591 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:23:35,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,625 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:23:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,627 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:23:35,628 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:23:35,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:35,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:35,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:35,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-22 12:23:35,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,662 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:23:35,663 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:23:35,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,697 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:23:35,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,699 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:23:35,700 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:23:35,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,733 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:23:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,734 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:23:35,735 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:23:35,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:35,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,773 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:23:35,774 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:23:35,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:23:35,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,806 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:23:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,808 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:23:35,808 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:23:35,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:35,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:35,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,867 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:23:35,867 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:23:35,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:35,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:35,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:35,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:35,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:35,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:35,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:35,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:23:35,939 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:23:35,939 INFO L444 ModelExtractionUtils]: 30 out of 52 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-07-22 12:23:35,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:35,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:35,941 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:35,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 12:23:35,942 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:23:35,949 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:23:35,949 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:23:35,949 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i~0, v_rep(select #length ~A~0.base)_1) = -4*~i~0 + 1*v_rep(select #length ~A~0.base)_1 Supporting invariants [] [2022-07-22 12:23:35,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 12:23:36,225 INFO L257 tatePredicateManager]: 48 out of 50 supporting invariants were superfluous and have been removed [2022-07-22 12:23:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:36,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 12:23:36,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:36,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:23:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:36,420 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:23:36,421 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-07-22 12:23:36,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 237 transitions. cyclomatic complexity: 167 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:23:36,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 237 transitions. cyclomatic complexity: 167. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 240 states and 634 transitions. Complement of second has 7 states. [2022-07-22 12:23:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:23:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:23:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-07-22 12:23:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:23:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-22 12:23:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-22 12:23:36,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:36,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 240 states and 634 transitions. [2022-07-22 12:23:36,588 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 30 [2022-07-22 12:23:36,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 240 states to 171 states and 441 transitions. [2022-07-22 12:23:36,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-07-22 12:23:36,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2022-07-22 12:23:36,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 441 transitions. [2022-07-22 12:23:36,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:23:36,592 INFO L220 hiAutomatonCegarLoop]: Abstraction has 171 states and 441 transitions. [2022-07-22 12:23:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 441 transitions. [2022-07-22 12:23:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 105. [2022-07-22 12:23:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 2.7714285714285714) internal successors, (291), 104 states have internal predecessors, (291), 0 states have call successors, (0), 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:23:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 291 transitions. [2022-07-22 12:23:36,600 INFO L242 hiAutomatonCegarLoop]: Abstraction has 105 states and 291 transitions. [2022-07-22 12:23:36,601 INFO L425 stractBuchiCegarLoop]: Abstraction has 105 states and 291 transitions. [2022-07-22 12:23:36,601 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:23:36,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 291 transitions. [2022-07-22 12:23:36,602 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2022-07-22 12:23:36,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:36,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:36,603 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:23:36,603 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:36,604 INFO L748 eck$LassoCheckResult]: Stem: 2806#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 2654#[L117-6]don't care [704] 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_171| |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_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_162| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_162| |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_#memory_int_161|) (= |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_198|, #memory_int=|v_#memory_int_162|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_171|, 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_198|, #memory_int=|v_#memory_int_161|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_171|, 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] 2656#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 2658#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 2816#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 2720#[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] 2722#[L59, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (select |v_#valid_184| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 4) (select |v_#length_157| |v_ULTIMATE.start_main_~#t2~0#1.base_53|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_47|) (= (store |v_#memory_int_152| |v_ULTIMATE.start_main_~#t2~0#1.base_53| (store (select |v_#memory_int_152| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre17#1_37|)) |v_#memory_int_151|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_37| |v_#pthreadsForks_52|)) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_152|, #length=|v_#length_157|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_151|, #length=|v_#length_157|, 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_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 2850#[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] 2852#[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] 2854#[L79, L59, L102-4]don't care [2022-07-22 12:23:36,604 INFO L750 eck$LassoCheckResult]: Loop: 2854#[L79, L59, L102-4]don't care [698] L79-->L79: Formula: (let ((.cse1 (* v_~start~0_81 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_53))) (and (= (ite (= (ite (or (< v_~start~0_80 v_~end~0_102) (< v_~i~0_93 v_~N~0_49)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_29|) (= (ite (and (< v_~start~0_81 v_~end~0_102) (< v_~start~0_81 v_~n~0_56) (<= 0 v_~start~0_81)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= v_~new~0_39 (select (select |v_#memory_int_159| v_~queue~0.base_53) .cse0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= 1 (select |v_#valid_188| v_~queue~0.base_53)) (= v_~start~0_80 (+ v_~start~0_81 1)) (= v_~new~0_39 v_~v_old~0_30) (not (= 0 (mod |v_thread2Thread1of1ForFork1_~cond~0#1_30| 256))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (<= 0 .cse0) (= (ite (= (ite (and (not (= (mod v_~ok~0_43 256) 0)) (<= v_~new~0_39 v_~v_old~0_31)) 1 0) 0) 0 1) v_~ok~0_42) (<= (+ .cse1 4 v_~queue~0.offset_53) (select |v_#length_161| v_~queue~0.base_53))))) InVars {~start~0=v_~start~0_81, ~queue~0.offset=v_~queue~0.offset_53, ~ok~0=v_~ok~0_43, ~i~0=v_~i~0_93, ~N~0=v_~N~0_49, ~queue~0.base=v_~queue~0.base_53, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_30|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_159|, ~end~0=v_~end~0_102, #length=|v_#length_161|, ~v_old~0=v_~v_old~0_31, ~n~0=v_~n~0_56} OutVars{~start~0=v_~start~0_80, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_53, ~ok~0=v_~ok~0_42, ~i~0=v_~i~0_93, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~N~0=v_~N~0_49, ~queue~0.base=v_~queue~0.base_53, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_17|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_29|, #valid=|v_#valid_188|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_159|, ~end~0=v_~end~0_102, #length=|v_#length_161|, ~v_old~0=v_~v_old~0_30, ~n~0=v_~n~0_56} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] 2854#[L79, L59, L102-4]don't care [2022-07-22 12:23:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1240206301, now seen corresponding path program 1 times [2022-07-22 12:23:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:36,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748648484] [2022-07-22 12:23:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:36,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:36,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 729, now seen corresponding path program 1 times [2022-07-22 12:23:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:36,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080416508] [2022-07-22 12:23:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:36,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:36,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash -208309635, now seen corresponding path program 1 times [2022-07-22 12:23:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:36,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496947503] [2022-07-22 12:23:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:36,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:36,812 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:23:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:36,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496947503] [2022-07-22 12:23:36,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496947503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:36,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:36,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:23:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543647998] [2022-07-22 12:23:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:23:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:23:37,018 INFO L87 Difference]: Start difference. First operand 105 states and 291 transitions. cyclomatic complexity: 212 Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:37,065 INFO L93 Difference]: Finished difference Result 125 states and 315 transitions. [2022-07-22 12:23:37,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 315 transitions. [2022-07-22 12:23:37,067 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:23:37,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 115 states and 291 transitions. [2022-07-22 12:23:37,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-22 12:23:37,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-07-22 12:23:37,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 291 transitions. [2022-07-22 12:23:37,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:23:37,070 INFO L220 hiAutomatonCegarLoop]: Abstraction has 115 states and 291 transitions. [2022-07-22 12:23:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 291 transitions. [2022-07-22 12:23:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-22 12:23:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 2.5304347826086957) internal successors, (291), 114 states have internal predecessors, (291), 0 states have call successors, (0), 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:23:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 291 transitions. [2022-07-22 12:23:37,076 INFO L242 hiAutomatonCegarLoop]: Abstraction has 115 states and 291 transitions. [2022-07-22 12:23:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:23:37,077 INFO L425 stractBuchiCegarLoop]: Abstraction has 115 states and 291 transitions. [2022-07-22 12:23:37,077 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:23:37,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 291 transitions. [2022-07-22 12:23:37,079 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:23:37,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:37,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:37,080 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:23:37,080 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:37,081 INFO L748 eck$LassoCheckResult]: Stem: 3167#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse2 (store |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79| 1)) (.cse0 (select |v_#memory_int_203| 1))) (and (= 0 v_~queue~0.offset_69) (< 0 |v_#StackHeapBarrier_48|) (= (select |v_#valid_264| 0) 0) (= 29 (select |v_#length_227| 2)) (= |v_#NULL.base_14| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) (= (select .cse0 1) 0) (= v_~v_old~0_50 0) (= v_~queue~0.base_69 0) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_262|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) (= (store (store (store |v_#length_227| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_79| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_121| 4)) |v_#length_225|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167| 0)) (= v_~n~0_80 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_121|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|) (= (select |v_#valid_264| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~end~0_118 v_~start~0_96) (= v_~i~0_111 0) (= |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) (= (select |v_#length_227| 1) 2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_48|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_79|) 0) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~last~0_64 0) (= v_~ok~0_62 1) (= v_~A~0.offset_99 0) (= (select |v_#valid_264| 2) 1) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (= (select .cse0 0) 48) (= v_~new~0_47 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= v_~A~0.base_99 0) (= (select |v_#valid_264| 1) 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, #valid=|v_#valid_264|, #memory_int=|v_#memory_int_203|, #length=|v_#length_227|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~A~0.base=v_~A~0.base_99, 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_69|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_225|, ~v_old~0=v_~v_old~0_50, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_49|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_47, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ~ok~0=v_~ok~0_62, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_111, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_121|, 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_59|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ~end~0=v_~end~0_118, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_53|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_96, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, 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_59|, 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_53|, 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_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_167|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_69, 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_77|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_81, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_69, #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_99, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_80, ~last~0=v_~last~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_135|} 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] 2997#[L117-6]don't care [704] 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_171| |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_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_162| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_162| |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_#memory_int_161|) (= |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_198|, #memory_int=|v_#memory_int_162|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_171|, 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_198|, #memory_int=|v_#memory_int_161|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_171|, 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] 2999#[L117-6]don't care [739] L117-6-->L117-14: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_46|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4)) |v_#length_221|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= (select |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| v_~N~0_79) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_#valid_258| (store |v_#valid_259| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92| v_~queue~0.offset_67) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue~0.base_67) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, #valid=|v_#valid_259|, #length=|v_#length_222|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_110|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ~queue~0.offset=v_~queue~0.offset_67, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_73|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_109|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_73|, ~N~0=v_~N~0_79, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ~queue~0.base=v_~queue~0.base_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, #StackHeapBarrier=|v_#StackHeapBarrier_46|, 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_163|, #valid=|v_#valid_258|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_221|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_131|, 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_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] 3001#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse1 (+ .cse0 |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|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_159| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (select |v_#valid_186| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse1) (= (store |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_156| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_155|)))) 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_186|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_159|, 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_186|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_159|, 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] 3183#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= 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)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_5| 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|) (= (select |v_#valid_In_5| v_~A~0.base_Out_2) 1) (= |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|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (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_5|, #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_5|, ~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_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ~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] 3067#[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] 3069#[L59, L101-4]don't care [694] L101-4-->L102-3: Formula: (and (= (select |v_#valid_184| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 4) (select |v_#length_157| |v_ULTIMATE.start_main_~#t2~0#1.base_53|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_47|) (= (store |v_#memory_int_152| |v_ULTIMATE.start_main_~#t2~0#1.base_53| (store (select |v_#memory_int_152| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre17#1_37|)) |v_#memory_int_151|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_37| |v_#pthreadsForks_52|)) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_152|, #length=|v_#length_157|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #valid=|v_#valid_184|, #memory_int=|v_#memory_int_151|, #length=|v_#length_157|, 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_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 3071#[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] 3137#[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] 3099#[L79, L59, L102-4]don't care [651] L59-->L49-2: Formula: (let ((.cse0 (* v_~i~0_69 4))) (let ((.cse1 (+ v_~A~0.offset_43 .cse0))) (and (<= (+ v_~A~0.offset_43 .cse0 4) (select |v_#length_99| v_~A~0.base_43)) (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| (select (select |v_#memory_int_99| v_~A~0.base_43) .cse1)) (<= 0 .cse1) (< v_~i~0_69 v_~N~0_31) (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_18) (= (select |v_#valid_114| v_~A~0.base_43) 1)))) InVars {~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_18} OutVars{~A~0.base=v_~A~0.base_43, ~A~0.offset=v_~A~0.offset_43, ~i~0=v_~i~0_69, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_99|, #length=|v_#length_99|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 3101#[L49-2, L79, L102-4]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~end~0_69 4)) (.cse1 (* v_~i~0_51 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31)) (.cse3 (+ v_~queue~0.offset_35 .cse2))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (select |v_#valid_92| v_~A~0.base_31) 1) (= v_~end~0_68 (+ v_~end~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~end~0_69) (< v_~end~0_69 v_~n~0_34)) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_77| v_~A~0.base_31)) (<= (+ 4 v_~queue~0.offset_35 .cse2) (select |v_#length_77| v_~queue~0.base_35)) (<= 0 .cse3) (= (select |v_#valid_92| v_~queue~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_69| v_~A~0.base_31) .cse0) (select (select |v_#memory_int_69| v_~queue~0.base_35) .cse3)) 1 0))))) InVars {~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_51, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_69, #length=|v_#length_77|, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_34} OutVars{~A~0.base=v_~A~0.base_31, ~queue~0.offset=v_~queue~0.offset_35, ~i~0=v_~i~0_51, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_7|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_35, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~A~0.offset=v_~A~0.offset_31, #valid=|v_#valid_92|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_69|, ~end~0=v_~end~0_68, #length=|v_#length_77|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_7|, ~n~0=v_~n~0_34, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|} 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] 3051#[L79, L102-4, L54]don't care [2022-07-22 12:23:37,081 INFO L750 eck$LassoCheckResult]: Loop: 3051#[L79, L102-4, L54]don't care [698] L79-->L79: Formula: (let ((.cse1 (* v_~start~0_81 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_53))) (and (= (ite (= (ite (or (< v_~start~0_80 v_~end~0_102) (< v_~i~0_93 v_~N~0_49)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_29|) (= (ite (and (< v_~start~0_81 v_~end~0_102) (< v_~start~0_81 v_~n~0_56) (<= 0 v_~start~0_81)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= v_~new~0_39 (select (select |v_#memory_int_159| v_~queue~0.base_53) .cse0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= 1 (select |v_#valid_188| v_~queue~0.base_53)) (= v_~start~0_80 (+ v_~start~0_81 1)) (= v_~new~0_39 v_~v_old~0_30) (not (= 0 (mod |v_thread2Thread1of1ForFork1_~cond~0#1_30| 256))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (<= 0 .cse0) (= (ite (= (ite (and (not (= (mod v_~ok~0_43 256) 0)) (<= v_~new~0_39 v_~v_old~0_31)) 1 0) 0) 0 1) v_~ok~0_42) (<= (+ .cse1 4 v_~queue~0.offset_53) (select |v_#length_161| v_~queue~0.base_53))))) InVars {~start~0=v_~start~0_81, ~queue~0.offset=v_~queue~0.offset_53, ~ok~0=v_~ok~0_43, ~i~0=v_~i~0_93, ~N~0=v_~N~0_49, ~queue~0.base=v_~queue~0.base_53, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_30|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_159|, ~end~0=v_~end~0_102, #length=|v_#length_161|, ~v_old~0=v_~v_old~0_31, ~n~0=v_~n~0_56} OutVars{~start~0=v_~start~0_80, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_53, ~ok~0=v_~ok~0_42, ~i~0=v_~i~0_93, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~N~0=v_~N~0_49, ~queue~0.base=v_~queue~0.base_53, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_17|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_29|, #valid=|v_#valid_188|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_159|, ~end~0=v_~end~0_102, #length=|v_#length_161|, ~v_old~0=v_~v_old~0_30, ~n~0=v_~n~0_56} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] 3051#[L79, L102-4, L54]don't care [2022-07-22 12:23:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2132335056, now seen corresponding path program 1 times [2022-07-22 12:23:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:37,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055314401] [2022-07-22 12:23:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:37,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:37,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:37,176 INFO L85 PathProgramCache]: Analyzing trace with hash 729, now seen corresponding path program 2 times [2022-07-22 12:23:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:37,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404804247] [2022-07-22 12:23:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:37,187 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:37,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1677877994, now seen corresponding path program 1 times [2022-07-22 12:23:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:37,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639357670] [2022-07-22 12:23:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:37,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:37,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:41,565 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:41,565 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:41,565 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:41,566 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:41,566 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:41,566 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:41,566 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:41,566 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:41,566 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-dec-subseq.wvr.c_BEv2_Iteration10_Lasso [2022-07-22 12:23:41,567 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:41,567 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:41,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:41,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:43,189 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:111) 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:23:43,193 INFO L158 Benchmark]: Toolchain (without parser) took 32579.62ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 108.3MB in the beginning and 185.5MB in the end (delta: -77.2MB). Peak memory consumption was 179.5MB. Max. memory is 8.0GB. [2022-07-22 12:23:43,193 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:23:43,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.17ms. Allocated memory is still 151.0MB. Free memory was 108.1MB in the beginning and 125.5MB in the end (delta: -17.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-07-22 12:23:43,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.24ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 134.4MB in the end (delta: -8.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:23:43,194 INFO L158 Benchmark]: Boogie Preprocessor took 45.18ms. Allocated memory is still 151.0MB. Free memory was 134.4MB in the beginning and 132.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:23:43,194 INFO L158 Benchmark]: RCFGBuilder took 893.09ms. Allocated memory is still 151.0MB. Free memory was 132.8MB in the beginning and 109.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-07-22 12:23:43,195 INFO L158 Benchmark]: BuchiAutomizer took 31217.74ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 109.2MB in the beginning and 185.5MB in the end (delta: -76.2MB). Peak memory consumption was 180.2MB. Max. memory is 8.0GB. [2022-07-22 12:23:43,197 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.23ms. Allocated memory is still 151.0MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 305.17ms. Allocated memory is still 151.0MB. Free memory was 108.1MB in the beginning and 125.5MB in the end (delta: -17.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 100.24ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 134.4MB in the end (delta: -8.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.18ms. Allocated memory is still 151.0MB. Free memory was 134.4MB in the beginning and 132.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 893.09ms. Allocated memory is still 151.0MB. Free memory was 132.8MB in the beginning and 109.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 31217.74ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 109.2MB in the beginning and 185.5MB in the end (delta: -76.2MB). Peak memory consumption was 180.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 173 PlacesBefore, 25 PlacesAfterwards, 181 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 133 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 6 ConcurrentYvCompositions, 10 ChoiceCompositions, 194 TotalNumberOfCompositions, 1138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 841, positive: 780, positive conditional: 0, positive unconditional: 780, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 468, positive: 449, positive conditional: 0, positive unconditional: 449, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 468, positive: 447, positive conditional: 0, positive unconditional: 447, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 841, positive: 331, positive conditional: 0, positive unconditional: 331, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 468, unknown conditional: 0, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - 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:23:43,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:43,427 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...