/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-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:02:25,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:02:25,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:02:25,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:02:25,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:02:25,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:02:25,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:02:25,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:02:26,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:02:26,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:02:26,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:02:26,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:02:26,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:02:26,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:02:26,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:02:26,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:02:26,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:02:26,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:02:26,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:02:26,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:02:26,052 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:02:26,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:02:26,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:02:26,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:02:26,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:02:26,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:02:26,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:02:26,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:02:26,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:02:26,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:02:26,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:02:26,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:02:26,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:02:26,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:02:26,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:02:26,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:02:26,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:02:26,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:02:26,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:02:26,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:02:26,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:02:26,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:02:26,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 12:02:26,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:02:26,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:02:26,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:02:26,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:02:26,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:02:26,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:02:26,137 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:02:26,137 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:02:26,138 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:02:26,139 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:02:26,139 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:02:26,139 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:02:26,139 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:02:26,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:02:26,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:02:26,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:02:26,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:02:26,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:02:26,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:02:26,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:02:26,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:02:26,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:02:26,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:02:26,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:02:26,141 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:02:26,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:02:26,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:02:26,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:02:26,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:02:26,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:02:26,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:02:26,143 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 12:02:26,146 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:02:26,147 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:02:26,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:02:26,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:02:26,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:02:26,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:02:26,518 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:02:26,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-07-22 12:02:26,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2229ef01/5b654849893c4a468741513be32ac453/FLAG66a00c1f3 [2022-07-22 12:02:27,252 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:02:27,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-07-22 12:02:27,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2229ef01/5b654849893c4a468741513be32ac453/FLAG66a00c1f3 [2022-07-22 12:02:27,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2229ef01/5b654849893c4a468741513be32ac453 [2022-07-22 12:02:27,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:02:27,618 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:02:27,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:27,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:02:27,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:02:27,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:27,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a16ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27, skipping insertion in model container [2022-07-22 12:02:27,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:27,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:02:27,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:02:27,899 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/unroll-cond-3.wvr.c[2641,2654] [2022-07-22 12:02:27,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:27,914 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:02:27,952 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/unroll-cond-3.wvr.c[2641,2654] [2022-07-22 12:02:27,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:27,984 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:02:27,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27 WrapperNode [2022-07-22 12:02:27,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:27,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:27,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:02:27,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:02:27,994 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:02:27" (1/1) ... [2022-07-22 12:02:28,004 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:02:27" (1/1) ... [2022-07-22 12:02:28,042 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 160 [2022-07-22 12:02:28,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:28,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:02:28,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:02:28,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:02:28,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,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:02:27" (1/1) ... [2022-07-22 12:02:28,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:02:28,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:02:28,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:02:28,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:02:28,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (1/1) ... [2022-07-22 12:02:28,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:28,120 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:02:28,123 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:02:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:02:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:02:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:02:28,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:02:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:02:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:02:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:02:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:02:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:02:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:02:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:02:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:02:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:02:28,201 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:02:28,287 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:02:28,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:02:28,868 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:02:28,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:02:28,883 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:02:28,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:28 BoogieIcfgContainer [2022-07-22 12:02:28,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:02:28,887 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:02:28,887 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:02:28,891 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:02:28,892 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:28,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:02:27" (1/3) ... [2022-07-22 12:02:28,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6acedc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:28, skipping insertion in model container [2022-07-22 12:02:28,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:28,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:27" (2/3) ... [2022-07-22 12:02:28,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6acedc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:28, skipping insertion in model container [2022-07-22 12:02:28,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:28,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:28" (3/3) ... [2022-07-22 12:02:28,897 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-07-22 12:02:29,056 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:02:29,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 195 places, 208 transitions, 432 flow [2022-07-22 12:02:29,191 INFO L129 PetriNetUnfolder]: 18/204 cut-off events. [2022-07-22 12:02:29,192 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:02:29,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 18/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2022-07-22 12:02:29,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 208 transitions, 432 flow [2022-07-22 12:02:29,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 204 transitions, 420 flow [2022-07-22 12:02:29,230 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:02:29,231 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:02:29,231 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:02:29,231 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:02:29,231 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:02:29,231 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:02:29,231 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:02:29,232 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:02:29,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:02:30,018 INFO L131 ngComponentsAnalysis]: Automaton has 158 accepting balls. 4882 [2022-07-22 12:02:30,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:30,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:30,030 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:30,030 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:30,031 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:02:30,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 5593 states, but on-demand construction may add more states [2022-07-22 12:02:30,161 INFO L131 ngComponentsAnalysis]: Automaton has 158 accepting balls. 4882 [2022-07-22 12:02:30,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:30,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:30,168 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:30,169 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:30,179 INFO L748 eck$LassoCheckResult]: Stem: 198#[ULTIMATE.startENTRY]don't care [460] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 201#[L-1]don't care [332] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 203#[L-1-1]don't care [473] L-1-1-->L-1-2: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 205#[L-1-2]don't care [478] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 207#[L21]don't care [413] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 209#[L21-1]don't care [453] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 211#[L21-2]don't care [340] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_9| 1) 1) 0) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 213#[L21-3]don't care [397] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 20) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 215#[L21-4]don't care [364] L21-4-->L42: Formula: (and (= v_~f~0.base_7 0) (= v_~f~0.offset_7 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_7, ~f~0.offset=v_~f~0.offset_7} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 217#[L42]don't care [352] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 219#[L42-1]don't care [456] L42-1-->L42-2: Formula: (= v_~x2~0_17 0) InVars {} OutVars{~x2~0=v_~x2~0_17} AuxVars[] AssignedVars[~x2~0] 221#[L42-2]don't care [362] L42-2-->L43: Formula: (= 0 v_~size~0_7) InVars {} OutVars{~size~0=v_~size~0_7} AuxVars[] AssignedVars[~size~0] 223#[L43]don't care [466] L43-->L-1-3: Formula: (= v_~n~0_9 0) InVars {} OutVars{~n~0=v_~n~0_9} AuxVars[] AssignedVars[~n~0] 225#[L-1-3]don't care [484] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 227#[L-1-4]don't care [336] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 229#[L-1-5]don't care [299] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 231#[L-1-6]don't care [444] L-1-6-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base] 233#[L84]don't care [457] L84-->L84-1: Formula: (and (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_10|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 235#[L84-1]don't care [472] L84-1-->L84-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 237#[L84-2]don't care [318] L84-2-->L87: Formula: (= v_~n~0_10 |v_ULTIMATE.start_main_#t~nondet13#1_2|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[~n~0] 239#[L87]don't care [350] L87-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 241#[L88]don't care [409] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet14#1_2| v_~size~0_8) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[~size~0] 243#[L88-1]don't care [452] L88-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 245#[L89]don't care [379] L89-->L89-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 247#[L89-1]don't care [343] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_9) 1 0)) InVars {~size~0=v_~size~0_9} OutVars{~size~0=v_~size~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 249#[L89-2]don't care [395] L89-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 251#[L37]don't care [354] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 253#[L38]don't care [366] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 257#[L37-1]don't care [355] L37-1-->L90: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 259#[L90]don't care [470] L90-->L90-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 261#[L90-1]don't care [313] L90-1-->L90-2: Formula: (= v_~size~0_10 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_10} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 263#[L90-2]don't care [319] L90-2-->L90-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 265#[L90-3]don't care [323] L90-3-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 267#[L104]don't care [304] L104-->L105: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 269#[L105]don't care [302] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 271#[L105-1]don't care [358] L105-1-->L105-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 273#[L105-2]don't care [334] L105-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 275#[L37-2]don't care [303] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 277#[L38-3]don't care [330] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 281#[L37-3]don't care [320] L37-3-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 283#[L106]don't care [455] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 285#[L106-1]don't care [445] L106-1-->L106-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 287#[L106-2]don't care [346] L106-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 289#[L37-4]don't care [438] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 291#[L38-6]don't care [411] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 295#[L37-5]don't care [389] L37-5-->L108: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 297#[L108]don't care [309] L108-->L108-1: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1) |v_#valid_19|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (= (store |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_14|) (= (select |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_19|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 299#[L108-1]don't care [393] L108-1-->L108-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 301#[L108-2]don't care [407] L108-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 303#[L109]don't care [439] L109-->L109-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 305#[L109-6]don't care [2022-07-22 12:02:30,190 INFO L750 eck$LassoCheckResult]: Loop: 305#[L109-6]don't care [450] L109-6-->L110: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 309#[L110]don't care [372] L110-->L110-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (select |v_#valid_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} AuxVars[] AssignedVars[#memory_int] 313#[L110-1]don't care [305] L110-1-->L109-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet24#1] 317#[L109-3]don't care [282] L109-3-->L109-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 321#[L109-4]don't care [308] L109-4-->L109-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 325#[L109-5]don't care [292] L109-5-->L109-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 305#[L109-6]don't care [2022-07-22 12:02:30,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1490278924, now seen corresponding path program 1 times [2022-07-22 12:02:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:30,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476774218] [2022-07-22 12:02:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:30,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:30,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1238636652, now seen corresponding path program 1 times [2022-07-22 12:02:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:30,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580521157] [2022-07-22 12:02:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:30,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:30,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1562033183, now seen corresponding path program 1 times [2022-07-22 12:02:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:30,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039899349] [2022-07-22 12:02:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:30,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:30,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:31,795 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:31,796 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:31,796 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:31,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:31,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:31,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:31,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:31,797 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:31,797 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-3.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:02:31,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:31,798 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:31,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:31,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:32,671 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:02:32,676 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:02:32,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:32,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:32,680 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:02:32,690 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:02:32,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:32,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:32,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:32,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:32,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:32,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:32,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:32,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:32,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:32,741 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:02:32,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:32,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:32,743 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:02:32,747 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:02:32,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:32,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:32,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:32,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:32,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:32,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:32,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:32,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:32,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:32,806 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:02:32,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:32,807 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:02:32,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:32,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:32,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:32,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:32,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:32,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:32,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:32,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:32,833 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:02:32,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:32,876 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:02:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:32,880 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:02:32,889 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:02:32,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:32,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:32,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:32,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:32,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:32,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:32,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:32,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:32,956 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:02:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:32,959 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:02:32,963 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:02:32,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:32,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:32,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:32,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:32,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:32,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:32,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:32,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:32,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-22 12:02:33,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,017 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:02:33,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,022 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:02:33,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,060 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:02:33,064 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:02:33,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:33,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,098 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:02:33,099 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:02:33,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,150 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:02:33,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,152 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:02:33,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,153 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:02:33,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,191 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:02:33,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,192 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:02:33,193 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:02:33,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-22 12:02:33,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,240 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:02:33,241 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:02:33,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,293 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:02:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,294 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:02:33,298 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:02:33,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,339 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:02:33,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,340 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:02:33,341 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:02:33,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,380 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:02:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,381 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:02:33,382 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:02:33,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,414 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:02:33,415 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:02:33,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:33,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,454 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:02:33,460 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:02:33,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:33,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:33,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:33,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,494 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:02:33,495 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:02:33,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,569 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:02:33,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,571 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:02:33,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,591 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:02:33,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,635 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:02:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,637 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:02:33,645 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:02:33,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,683 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:02:33,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,684 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:02:33,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:02:33,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,753 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:02:33,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,755 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:02:33,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,776 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:02:33,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 12:02:33,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,802 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:02:33,803 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:02:33,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:02:33,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,843 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:02:33,845 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:02:33,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,895 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:02:33,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,896 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:02:33,897 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:02:33,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,905 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:02:33,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,909 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:02:33,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:33,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:33,961 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:02:33,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:33,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:33,962 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:02:33,965 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:02:33,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:33,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:33,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:33,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:33,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:33,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:33,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,026 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:02:34,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,027 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:02:34,028 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:02:34,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:34,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,066 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:02:34,067 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:02:34,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,105 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:02:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,108 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:02:34,114 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:02:34,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:34,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:34,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:34,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:02:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,147 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:02:34,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,149 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:02:34,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:02:34,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,190 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:02:34,191 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:02:34,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:34,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,262 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:02:34,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,287 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:02:34,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:34,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,333 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:02:34,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,356 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:02:34,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,401 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:02:34,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,404 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:02:34,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:34,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:34,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:34,423 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:02:34,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:34,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,470 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:02:34,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:34,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:34,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:34,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:34,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:34,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:34,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:34,500 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:02:34,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:02:34,535 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:02:34,536 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:02:34,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,539 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:02:34,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:02:34,558 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:02:34,571 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:02:34,572 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:02:34,573 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:02:34,629 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:02:34,679 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:02:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:34,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:34,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:34,886 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:02:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:34,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:34,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:34,967 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:02:35,029 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 12:02:35,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5593 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:02:35,373 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5593 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 11173 states and 32356 transitions. Complement of second has 8 states. [2022-07-22 12:02:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:02:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:02:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2022-07-22 12:02:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 236 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:35,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:35,386 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:02:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:35,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:35,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:35,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:35,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:35,549 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:02:35,550 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 12:02:35,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5593 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:02:35,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5593 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 11167 states and 32349 transitions. Complement of second has 10 states. [2022-07-22 12:02:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 12:02:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:02:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2022-07-22 12:02:35,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 237 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:35,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:35,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 237 transitions. Stem has 56 letters. Loop has 6 letters. [2022-07-22 12:02:35,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:35,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 237 transitions. Stem has 50 letters. Loop has 12 letters. [2022-07-22 12:02:35,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:35,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11167 states and 32349 transitions. [2022-07-22 12:02:35,990 INFO L131 ngComponentsAnalysis]: Automaton has 157 accepting balls. 4876 [2022-07-22 12:02:36,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11167 states to 5109 states and 14752 transitions. [2022-07-22 12:02:36,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5102 [2022-07-22 12:02:36,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5103 [2022-07-22 12:02:36,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5109 states and 14752 transitions. [2022-07-22 12:02:36,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:36,103 INFO L220 hiAutomatonCegarLoop]: Abstraction has 5109 states and 14752 transitions. [2022-07-22 12:02:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states and 14752 transitions. [2022-07-22 12:02:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5109. [2022-07-22 12:02:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 5109 states have (on average 2.8874535134077117) internal successors, (14752), 5108 states have internal predecessors, (14752), 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:02:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 14752 transitions. [2022-07-22 12:02:36,347 INFO L242 hiAutomatonCegarLoop]: Abstraction has 5109 states and 14752 transitions. [2022-07-22 12:02:36,347 INFO L425 stractBuchiCegarLoop]: Abstraction has 5109 states and 14752 transitions. [2022-07-22 12:02:36,347 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:02:36,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5109 states and 14752 transitions. [2022-07-22 12:02:36,389 INFO L131 ngComponentsAnalysis]: Automaton has 157 accepting balls. 4876 [2022-07-22 12:02:36,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:36,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:36,393 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:36,393 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:36,395 INFO L748 eck$LassoCheckResult]: Stem: 44102#[ULTIMATE.startENTRY]don't care [460] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44104#[L-1]don't care [332] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 38170#[L-1-1]don't care [473] L-1-1-->L-1-2: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 38172#[L-1-2]don't care [478] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 43478#[L21]don't care [413] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 39792#[L21-1]don't care [453] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 35654#[L21-2]don't care [340] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_9| 1) 1) 0) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 35656#[L21-3]don't care [397] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 20) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 42844#[L21-4]don't care [364] L21-4-->L42: Formula: (and (= v_~f~0.base_7 0) (= v_~f~0.offset_7 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_7, ~f~0.offset=v_~f~0.offset_7} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 42114#[L42]don't care [352] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 42116#[L42-1]don't care [456] L42-1-->L42-2: Formula: (= v_~x2~0_17 0) InVars {} OutVars{~x2~0=v_~x2~0_17} AuxVars[] AssignedVars[~x2~0] 41730#[L42-2]don't care [362] L42-2-->L43: Formula: (= 0 v_~size~0_7) InVars {} OutVars{~size~0=v_~size~0_7} AuxVars[] AssignedVars[~size~0] 40972#[L43]don't care [466] L43-->L-1-3: Formula: (= v_~n~0_9 0) InVars {} OutVars{~n~0=v_~n~0_9} AuxVars[] AssignedVars[~n~0] 39852#[L-1-3]don't care [484] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 39854#[L-1-4]don't care [336] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43782#[L-1-5]don't care [299] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 43944#[L-1-6]don't care [444] L-1-6-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base] 43522#[L84]don't care [457] L84-->L84-1: Formula: (and (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_10|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 42302#[L84-1]don't care [472] L84-1-->L84-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 42304#[L84-2]don't care [318] L84-2-->L87: Formula: (= v_~n~0_10 |v_ULTIMATE.start_main_#t~nondet13#1_2|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[~n~0] 43982#[L87]don't care [350] L87-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 43984#[L88]don't care [409] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet14#1_2| v_~size~0_8) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[~size~0] 44306#[L88-1]don't care [452] L88-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 43926#[L89]don't care [379] L89-->L89-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 39436#[L89-1]don't care [343] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_9) 1 0)) InVars {~size~0=v_~size~0_9} OutVars{~size~0=v_~size~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 39438#[L89-2]don't care [395] L89-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 42888#[L37]don't care [354] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 37680#[L38]don't care [366] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 37682#[L37-1]don't care [355] L37-1-->L90: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42534#[L90]don't care [470] L90-->L90-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 37348#[L90-1]don't care [313] L90-1-->L90-2: Formula: (= v_~size~0_10 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_10} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 35484#[L90-2]don't care [319] L90-2-->L90-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 35486#[L90-3]don't care [323] L90-3-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 43336#[L104]don't care [304] L104-->L105: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 43338#[L105]don't care [302] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44378#[L105-1]don't care [358] L105-1-->L105-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 38426#[L105-2]don't care [334] L105-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 37284#[L37-2]don't care [303] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 37286#[L38-3]don't care [330] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 44288#[L37-3]don't care [320] L37-3-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44348#[L106]don't care [455] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44312#[L106-1]don't care [445] L106-1-->L106-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 42104#[L106-2]don't care [346] L106-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 42106#[L37-4]don't care [438] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 44014#[L38-6]don't care [411] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 43820#[L37-5]don't care [389] L37-5-->L108: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 41098#[L108]don't care [309] L108-->L108-1: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1) |v_#valid_19|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (= (store |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_14|) (= (select |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_19|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 41100#[L108-1]don't care [393] L108-1-->L108-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 40878#[L108-2]don't care [407] L108-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 40880#[L109]don't care [439] L109-->L109-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 42960#[L109-6]don't care [449] L109-6-->L109-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 42962#[L109-7]don't care [408] L109-7-->L112: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 43894#[L112]don't care [347] L112-->L90-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret15#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 40956#[L90-4]don't care [451] L90-4-->L90-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 40958#[L90-5]don't care [326] L90-5-->L90-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_3| v_~f~0.base_8) (= |v_ULTIMATE.start_main_#t~ret15#1.offset_3| v_~f~0.offset_8)) InVars {ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|, ~f~0.base=v_~f~0.base_8, ~f~0.offset=v_~f~0.offset_8} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 36920#[L90-6]don't care [404] L90-6-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_4|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 36922#[L93]don't care [325] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre16#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1] 40034#[L93-1]don't care [446] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 41446#[L93-2]don't care [415] L93-2-->L93-3: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre16#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 40342#[L93-3]don't care [588] L93-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 40344#[L93-4, thread1ENTRY]don't care [486] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 44078#[L93-4, L49-2]don't care [2022-07-22 12:02:36,395 INFO L750 eck$LassoCheckResult]: Loop: 44078#[L93-4, L49-2]don't care [489] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_5| 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} AuxVars[] AssignedVars[] 39560#[L50, L93-4]don't care [491] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 39562#[L93-4, L50-1]don't care [493] L50-1-->L50-2: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0)) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] 43292#[L93-4, L50-2]don't care [494] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 44268#[L37, L93-4]don't care [495] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 44270#[L93-4, L38]don't care [497] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 38280#[L37-1, L93-4]don't care [499] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 34430#[L51, L93-4]don't care [500] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (<= (+ .cse1 v_~f~0.offset_1 4) (select |v_#length_1| v_~f~0.base_1))))) InVars {~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} OutVars{~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 34432#[L93-4, L51-1]don't care [501] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 41330#[L51-2, L93-4]don't care [502] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 40470#[L52, L93-4]don't care [503] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork0_#t~post2#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_7|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 38944#[L52-1, L93-4]don't care [504] L52-1-->L52-2: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post2#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 38946#[L93-4, L52-2]don't care [505] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 44078#[L93-4, L49-2]don't care [2022-07-22 12:02:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -42668641, now seen corresponding path program 1 times [2022-07-22 12:02:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:36,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779316893] [2022-07-22 12:02:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:36,664 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:02:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:02:36,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779316893] [2022-07-22 12:02:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779316893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:02:36,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:02:36,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 12:02:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890778830] [2022-07-22 12:02:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:02:36,669 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:02:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1224282576, now seen corresponding path program 1 times [2022-07-22 12:02:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936780890] [2022-07-22 12:02:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:36,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:36,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:36,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:02:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 12:02:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 12:02:36,818 INFO L87 Difference]: Start difference. First operand 5109 states and 14752 transitions. cyclomatic complexity: 9801 Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:02:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:02:36,964 INFO L93 Difference]: Finished difference Result 5113 states and 13886 transitions. [2022-07-22 12:02:36,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5113 states and 13886 transitions. [2022-07-22 12:02:37,087 INFO L131 ngComponentsAnalysis]: Automaton has 173 accepting balls. 4673 [2022-07-22 12:02:37,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5113 states to 4932 states and 13387 transitions. [2022-07-22 12:02:37,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4922 [2022-07-22 12:02:37,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4922 [2022-07-22 12:02:37,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4932 states and 13387 transitions. [2022-07-22 12:02:37,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:37,177 INFO L220 hiAutomatonCegarLoop]: Abstraction has 4932 states and 13387 transitions. [2022-07-22 12:02:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states and 13387 transitions. [2022-07-22 12:02:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4928. [2022-07-22 12:02:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 4928 states have (on average 2.715706168831169) internal successors, (13383), 4927 states have internal predecessors, (13383), 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:02:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 13383 transitions. [2022-07-22 12:02:37,360 INFO L242 hiAutomatonCegarLoop]: Abstraction has 4928 states and 13383 transitions. [2022-07-22 12:02:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 12:02:37,361 INFO L425 stractBuchiCegarLoop]: Abstraction has 4928 states and 13383 transitions. [2022-07-22 12:02:37,361 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:02:37,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4928 states and 13383 transitions. [2022-07-22 12:02:37,418 INFO L131 ngComponentsAnalysis]: Automaton has 173 accepting balls. 4673 [2022-07-22 12:02:37,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:37,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:37,420 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:37,420 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:37,422 INFO L748 eck$LassoCheckResult]: Stem: 59078#[ULTIMATE.startENTRY]don't care [460] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59080#[L-1]don't care [332] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 53294#[L-1-1]don't care [473] L-1-1-->L-1-2: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 53296#[L-1-2]don't care [478] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 58436#[L21]don't care [413] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 54810#[L21-1]don't care [453] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 50898#[L21-2]don't care [340] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_9| 1) 1) 0) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 50900#[L21-3]don't care [397] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 20) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 57794#[L21-4]don't care [364] L21-4-->L42: Formula: (and (= v_~f~0.base_7 0) (= v_~f~0.offset_7 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_7, ~f~0.offset=v_~f~0.offset_7} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 57070#[L42]don't care [352] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 57072#[L42-1]don't care [456] L42-1-->L42-2: Formula: (= v_~x2~0_17 0) InVars {} OutVars{~x2~0=v_~x2~0_17} AuxVars[] AssignedVars[~x2~0] 56688#[L42-2]don't care [362] L42-2-->L43: Formula: (= 0 v_~size~0_7) InVars {} OutVars{~size~0=v_~size~0_7} AuxVars[] AssignedVars[~size~0] 55948#[L43]don't care [466] L43-->L-1-3: Formula: (= v_~n~0_9 0) InVars {} OutVars{~n~0=v_~n~0_9} AuxVars[] AssignedVars[~n~0] 54876#[L-1-3]don't care [484] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54878#[L-1-4]don't care [336] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 58720#[L-1-5]don't care [299] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 58906#[L-1-6]don't care [444] L-1-6-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base] 58486#[L84]don't care [457] L84-->L84-1: Formula: (and (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_10|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 57260#[L84-1]don't care [472] L84-1-->L84-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 57262#[L84-2]don't care [318] L84-2-->L87: Formula: (= v_~n~0_10 |v_ULTIMATE.start_main_#t~nondet13#1_2|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[~n~0] 58950#[L87]don't care [350] L87-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 58952#[L88]don't care [409] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet14#1_2| v_~size~0_8) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[~size~0] 59292#[L88-1]don't care [452] L88-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 58886#[L89]don't care [379] L89-->L89-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54468#[L89-1]don't care [343] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_9) 1 0)) InVars {~size~0=v_~size~0_9} OutVars{~size~0=v_~size~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 54470#[L89-2]don't care [395] L89-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 57840#[L37]don't care [354] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52814#[L38]don't care [366] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 52816#[L37-1]don't care [355] L37-1-->L90: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 57484#[L90]don't care [470] L90-->L90-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 52504#[L90-1]don't care [313] L90-1-->L90-2: Formula: (= v_~size~0_10 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_10} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 50738#[L90-2]don't care [319] L90-2-->L90-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 50740#[L90-3]don't care [323] L90-3-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 58286#[L104]don't care [304] L104-->L105: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 58288#[L105]don't care [302] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59366#[L105-1]don't care [358] L105-1-->L105-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 53506#[L105-2]don't care [334] L105-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52442#[L37-2]don't care [303] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52444#[L38-3]don't care [330] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 59276#[L37-3]don't care [320] L37-3-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59336#[L106]don't care [455] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59298#[L106-1]don't care [445] L106-1-->L106-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 57060#[L106-2]don't care [346] L106-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 57062#[L37-4]don't care [438] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 58980#[L38-6]don't care [411] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 58768#[L37-5]don't care [389] L37-5-->L108: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56064#[L108]don't care [309] L108-->L108-1: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1) |v_#valid_19|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (= (store |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_14|) (= (select |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_19|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 56066#[L108-1]don't care [393] L108-1-->L108-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 55858#[L108-2]don't care [407] L108-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 55860#[L109]don't care [439] L109-->L109-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 57914#[L109-6]don't care [450] L109-6-->L110: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 57916#[L110]don't care [372] L110-->L110-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (select |v_#valid_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} AuxVars[] AssignedVars[#memory_int] 52460#[L110-1]don't care [305] L110-1-->L109-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet24#1] 52462#[L109-3]don't care [282] L109-3-->L109-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 58540#[L109-4]don't care [308] L109-4-->L109-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 51606#[L109-5]don't care [292] L109-5-->L109-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 51608#[L109-6]don't care [449] L109-6-->L109-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 57918#[L109-7]don't care [408] L109-7-->L112: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 58852#[L112]don't care [347] L112-->L90-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret15#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 55932#[L90-4]don't care [451] L90-4-->L90-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 55934#[L90-5]don't care [326] L90-5-->L90-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_3| v_~f~0.base_8) (= |v_ULTIMATE.start_main_#t~ret15#1.offset_3| v_~f~0.offset_8)) InVars {ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|, ~f~0.base=v_~f~0.base_8, ~f~0.offset=v_~f~0.offset_8} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 52110#[L90-6]don't care [404] L90-6-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_4|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 52112#[L93]don't care [325] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre16#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1] 55028#[L93-1]don't care [446] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 56410#[L93-2]don't care [415] L93-2-->L93-3: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre16#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 55344#[L93-3]don't care [588] L93-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 55346#[L93-4, thread1ENTRY]don't care [486] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 59052#[L93-4, L49-2]don't care [2022-07-22 12:02:37,422 INFO L750 eck$LassoCheckResult]: Loop: 59052#[L93-4, L49-2]don't care [489] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_5| 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} AuxVars[] AssignedVars[] 54580#[L50, L93-4]don't care [491] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54582#[L93-4, L50-1]don't care [493] L50-1-->L50-2: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0)) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] 58246#[L93-4, L50-2]don't care [494] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 59252#[L37, L93-4]don't care [495] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 59254#[L93-4, L38]don't care [497] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 55712#[L37-1, L93-4]don't care [499] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49772#[L51, L93-4]don't care [500] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (<= (+ .cse1 v_~f~0.offset_1 4) (select |v_#length_1| v_~f~0.base_1))))) InVars {~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} OutVars{~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 49774#[L93-4, L51-1]don't care [501] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 56306#[L51-2, L93-4]don't care [502] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 55460#[L52, L93-4]don't care [503] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork0_#t~post2#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_7|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 53992#[L52-1, L93-4]don't care [504] L52-1-->L52-2: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post2#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 53994#[L93-4, L52-2]don't care [505] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 59052#[L93-4, L49-2]don't care [2022-07-22 12:02:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1216568980, now seen corresponding path program 1 times [2022-07-22 12:02:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195659561] [2022-07-22 12:02:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,454 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1224282576, now seen corresponding path program 2 times [2022-07-22 12:02:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517597611] [2022-07-22 12:02:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:37,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1337539101, now seen corresponding path program 1 times [2022-07-22 12:02:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887053911] [2022-07-22 12:02:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:39,506 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:39,506 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:39,506 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:39,506 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:39,506 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:39,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:39,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:39,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:39,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-3.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:02:39,508 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:39,508 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:39,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,730 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:02:39,734 INFO L158 Benchmark]: Toolchain (without parser) took 12118.78ms. Allocated memory was 162.5MB in the beginning and 308.3MB in the end (delta: 145.8MB). Free memory was 136.6MB in the beginning and 183.6MB in the end (delta: -47.1MB). Peak memory consumption was 209.0MB. Max. memory is 8.0GB. [2022-07-22 12:02:39,734 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 162.5MB. Free memory was 132.6MB in the beginning and 132.5MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:02:39,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.46ms. Allocated memory is still 162.5MB. Free memory was 136.4MB in the beginning and 125.3MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:02:39,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.64ms. Allocated memory is still 162.5MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:39,736 INFO L158 Benchmark]: Boogie Preprocessor took 32.43ms. Allocated memory is still 162.5MB. Free memory was 123.2MB in the beginning and 121.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:02:39,737 INFO L158 Benchmark]: RCFGBuilder took 809.35ms. Allocated memory is still 162.5MB. Free memory was 121.6MB in the beginning and 140.9MB in the end (delta: -19.3MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2022-07-22 12:02:39,737 INFO L158 Benchmark]: BuchiAutomizer took 10845.16ms. Allocated memory was 162.5MB in the beginning and 308.3MB in the end (delta: 145.8MB). Free memory was 140.9MB in the beginning and 183.6MB in the end (delta: -42.7MB). Peak memory consumption was 212.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:39,741 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.20ms. Allocated memory is still 162.5MB. Free memory was 132.6MB in the beginning and 132.5MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 362.46ms. Allocated memory is still 162.5MB. Free memory was 136.4MB in the beginning and 125.3MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.64ms. Allocated memory is still 162.5MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.43ms. Allocated memory is still 162.5MB. Free memory was 123.2MB in the beginning and 121.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 809.35ms. Allocated memory is still 162.5MB. Free memory was 121.6MB in the beginning and 140.9MB in the end (delta: -19.3MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 10845.16ms. Allocated memory was 162.5MB in the beginning and 308.3MB in the end (delta: 145.8MB). Free memory was 140.9MB in the beginning and 183.6MB in the end (delta: -42.7MB). Peak memory consumption was 212.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - 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:02:39,784 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...