/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-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:02:16,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:02:16,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:02:16,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:02:16,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:02:16,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:02:16,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:02:16,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:02:16,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:02:16,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:02:16,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:02:16,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:02:16,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:02:16,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:02:16,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:02:16,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:02:16,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:02:16,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:02:16,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:02:16,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:02:16,302 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:02:16,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:02:16,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:02:16,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:02:16,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:02:16,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:02:16,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:02:16,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:02:16,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:02:16,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:02:16,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:02:16,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:02:16,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:02:16,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:02:16,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:02:16,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:02:16,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:02:16,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:02:16,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:02:16,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:02:16,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:02:16,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:02:16,330 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:16,379 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:02:16,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:02:16,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:02:16,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:02:16,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:02:16,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:02:16,383 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:02:16,384 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:02:16,384 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:02:16,385 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:02:16,385 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:02:16,385 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:02:16,386 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:02:16,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:02:16,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:02:16,386 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:02:16,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:02:16,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:02:16,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:02:16,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:02:16,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:02:16,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:02:16,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:02:16,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:02:16,388 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:02:16,389 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:02:16,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:02:16,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:02:16,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:02:16,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:02:16,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:02:16,390 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 12:02:16,393 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:02:16,394 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:16,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:02:16,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:02:16,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:02:16,827 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:02:16,829 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:02:16,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-07-22 12:02:16,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c03b2d59/51fc4b9723bc419db89969fb613d2fdd/FLAGac75723f6 [2022-07-22 12:02:17,647 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:02:17,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-07-22 12:02:17,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c03b2d59/51fc4b9723bc419db89969fb613d2fdd/FLAGac75723f6 [2022-07-22 12:02:17,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c03b2d59/51fc4b9723bc419db89969fb613d2fdd [2022-07-22 12:02:17,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:02:17,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:02:17,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:17,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:02:17,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:02:17,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:17" (1/1) ... [2022-07-22 12:02:17,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26cd16b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:17, skipping insertion in model container [2022-07-22 12:02:17,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:17" (1/1) ... [2022-07-22 12:02:18,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:02:18,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:02:18,226 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-2.wvr.c[2428,2441] [2022-07-22 12:02:18,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:18,243 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:02:18,269 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-2.wvr.c[2428,2441] [2022-07-22 12:02:18,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:18,291 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:02:18,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:18 WrapperNode [2022-07-22 12:02:18,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:18,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:18,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:02:18,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:02:18,304 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:18" (1/1) ... [2022-07-22 12:02:18,314 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:18" (1/1) ... [2022-07-22 12:02:18,343 INFO L137 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 132 [2022-07-22 12:02:18,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:18,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:02:18,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:02:18,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:02:18,355 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:18" (1/1) ... [2022-07-22 12:02:18,356 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:18" (1/1) ... [2022-07-22 12:02:18,359 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:18" (1/1) ... [2022-07-22 12:02:18,360 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:18" (1/1) ... [2022-07-22 12:02:18,367 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:18" (1/1) ... [2022-07-22 12:02:18,373 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:18" (1/1) ... [2022-07-22 12:02:18,375 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:18" (1/1) ... [2022-07-22 12:02:18,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:02:18,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:02:18,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:02:18,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:02:18,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:18" (1/1) ... [2022-07-22 12:02:18,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:18,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:18,427 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:18,447 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:18,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:02:18,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:02:18,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:02:18,500 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:02:18,500 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:02:18,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:02:18,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:02:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:02:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:02:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:02:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:02:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:02:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:02:18,504 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:18,617 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:02:18,619 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:02:19,012 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:02:19,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:02:19,027 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:02:19,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:19 BoogieIcfgContainer [2022-07-22 12:02:19,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:02:19,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:02:19,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:02:19,038 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:02:19,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:19,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:02:17" (1/3) ... [2022-07-22 12:02:19,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@af69e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:19, skipping insertion in model container [2022-07-22 12:02:19,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:19,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:18" (2/3) ... [2022-07-22 12:02:19,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@af69e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:19, skipping insertion in model container [2022-07-22 12:02:19,043 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:19,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:19" (3/3) ... [2022-07-22 12:02:19,045 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-2.wvr.c [2022-07-22 12:02:19,231 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:02:19,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 170 transitions, 356 flow [2022-07-22 12:02:19,375 INFO L129 PetriNetUnfolder]: 14/166 cut-off events. [2022-07-22 12:02:19,375 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:02:19,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 166 events. 14/166 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2022-07-22 12:02:19,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 170 transitions, 356 flow [2022-07-22 12:02:19,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 166 transitions, 344 flow [2022-07-22 12:02:19,418 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:02:19,419 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:02:19,419 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:02:19,419 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:02:19,419 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:02:19,419 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:02:19,420 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:02:19,420 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:02:19,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:02:19,802 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 2339 [2022-07-22 12:02:19,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:19,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:19,812 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:19,812 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:19,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:02:19,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2525 states, but on-demand construction may add more states [2022-07-22 12:02:19,877 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 2339 [2022-07-22 12:02:19,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:19,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:19,880 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:19,880 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:19,889 INFO L748 eck$LassoCheckResult]: Stem: 164#[ULTIMATE.startENTRY]don't care [372] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 167#[L-1]don't care [263] 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] 169#[L-1-1]don't care [382] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 171#[L-1-2]don't care [386] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 173#[L21]don't care [338] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 175#[L21-1]don't care [366] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 177#[L21-2]don't care [272] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 179#[L21-3]don't care [320] L21-3-->L21-4: Formula: (and (= 15 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 181#[L21-4]don't care [295] L21-4-->L42: Formula: (and (= v_~f~0.offset_4 0) (= v_~f~0.base_4 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_4, ~f~0.offset=v_~f~0.offset_4} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 183#[L42]don't care [284] L42-->L42-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] 185#[L42-1]don't care [368] L42-1-->L42-2: Formula: (= v_~x2~0_7 0) InVars {} OutVars{~x2~0=v_~x2~0_7} AuxVars[] AssignedVars[~x2~0] 187#[L42-2]don't care [293] L42-2-->L43: Formula: (= 0 v_~size~0_4) InVars {} OutVars{~size~0=v_~size~0_4} AuxVars[] AssignedVars[~size~0] 189#[L43]don't care [374] L43-->L-1-3: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 191#[L-1-3]don't care [392] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 193#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 195#[L-1-5]don't care [240] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 197#[L-1-6]don't care [359] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 199#[L71]don't care [308] L71-->L71-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 201#[L71-1]don't care [245] L71-1-->L71-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 203#[L71-2]don't care [385] L71-2-->L74: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 205#[L74]don't care [307] L74-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 207#[L75]don't care [289] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~size~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~size~0=v_~size~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~size~0] 209#[L75-1]don't care [252] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 211#[L76]don't care [299] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 213#[L76-1]don't care [364] L76-1-->L76-2: Formula: (= (ite (< 0 v_~size~0_6) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_6} OutVars{~size~0=v_~size~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 215#[L76-2]don't care [375] L76-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 217#[L37]don't care [286] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 219#[L38]don't care [297] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 223#[L37-1]don't care [287] L37-1-->L77: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 225#[L77]don't care [312] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 227#[L77-1]don't care [324] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_7) InVars {~size~0=v_~size~0_7} 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_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 229#[L77-2]don't care [265] L77-2-->L77-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] 231#[L77-3]don't care [314] L77-3-->L93: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 233#[L93]don't care [257] L93-->L94: 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] 235#[L94]don't care [369] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 237#[L94-1]don't care [313] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 239#[L94-2]don't care [345] L94-2-->L37-2: 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] 241#[L37-2]don't care [242] L37-2-->L38-3: 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] 243#[L38-3]don't care [261] L38-3-->L37-3: 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[] 247#[L37-3]don't care [253] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 249#[L95]don't care [325] L95-->L95-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 251#[L95-1]don't care [342] L95-1-->L95-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_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 253#[L95-2]don't care [343] L95-2-->L37-4: 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] 255#[L37-4]don't care [355] L37-4-->L38-6: 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] 257#[L38-6]don't care [336] L38-6-->L37-5: 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[] 259#[L37-5]don't care [316] L37-5-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 263#[L97]don't care [310] L97-->L97-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4))) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1) |v_#valid_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 265#[L97-1]don't care [319] L97-1-->L97-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 267#[L97-2]don't care [379] L97-2-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 269#[L98]don't care [344] L98-->L98-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] 271#[L98-6]don't care [2022-07-22 12:02:19,891 INFO L750 eck$LassoCheckResult]: Loop: 271#[L98-6]don't care [328] L98-6-->L99: 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[] 275#[L99]don't care [352] L99-->L99-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) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_6|)))) 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|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} 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|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 279#[L99-1]don't care [271] L99-1-->L98-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 283#[L98-3]don't care [340] L98-3-->L98-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#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_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 287#[L98-4]don't care [315] L98-4-->L98-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 291#[L98-5]don't care [288] L98-5-->L98-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 271#[L98-6]don't care [2022-07-22 12:02:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 593600126, now seen corresponding path program 1 times [2022-07-22 12:02:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:19,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144142573] [2022-07-22 12:02:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:20,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:20,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2021420163, now seen corresponding path program 1 times [2022-07-22 12:02:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:20,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863796490] [2022-07-22 12:02:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:20,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:20,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1139115712, now seen corresponding path program 1 times [2022-07-22 12:02:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:20,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240446937] [2022-07-22 12:02:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:20,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:20,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:21,505 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:21,506 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:21,506 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:21,506 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:21,507 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:21,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:21,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:21,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:21,507 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:02:21,508 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:21,508 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:21,532 INFO L141 MapEliminator]: 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:21,538 INFO L141 MapEliminator]: 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:21,544 INFO L141 MapEliminator]: 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:21,546 INFO L141 MapEliminator]: 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:21,548 INFO L141 MapEliminator]: 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:21,551 INFO L141 MapEliminator]: 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:21,552 INFO L141 MapEliminator]: 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:21,554 INFO L141 MapEliminator]: 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:21,557 INFO L141 MapEliminator]: 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:21,559 INFO L141 MapEliminator]: 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:21,561 INFO L141 MapEliminator]: 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:21,563 INFO L141 MapEliminator]: 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:21,565 INFO L141 MapEliminator]: 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:21,568 INFO L141 MapEliminator]: 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:21,569 INFO L141 MapEliminator]: 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:21,572 INFO L141 MapEliminator]: 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:21,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:21,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:22,001 INFO L141 MapEliminator]: 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:22,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:22,548 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:02:22,554 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:02:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,559 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:22,569 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:22,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:22,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:22,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:22,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:22,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:22,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,627 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:22,628 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:22,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:22,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:22,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:22,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,691 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:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,695 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:22,696 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:22,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:22,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:22,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:22,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:22,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,762 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:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,765 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:22,769 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:22,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:22,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:22,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:22,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 12:02:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,824 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:22,825 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:22,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:22,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:22,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:22,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,881 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:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,883 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:22,884 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:22,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:22,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:22,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:22,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:22,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,918 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:22,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,921 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:22,922 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:22,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:22,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:22,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:22,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:22,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:22,956 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:22,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:22,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:22,958 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:22,966 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:22,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:22,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:22,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:22,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:22,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:22,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:22,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:22,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,023 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:23,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,026 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:23,027 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:23,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:23,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:23,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:23,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,090 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:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,092 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:23,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,107 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:23,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:23,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:23,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,170 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:23,177 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:23,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:23,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:23,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:23,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:23,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,230 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:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,232 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:23,232 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:23,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:23,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:23,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:23,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:23,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,269 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:23,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,270 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:23,271 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:23,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:23,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:23,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,317 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:23,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,318 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:23,319 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:23,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:23,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:23,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:23,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,353 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:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,355 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:23,356 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:23,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:23,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:23,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:23,399 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:23,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,403 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:23,405 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:23,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:23,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:23,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:23,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:23,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:23,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:23,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:02:23,544 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:02:23,544 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-22 12:02:23,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:23,548 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:23,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:02:23,565 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:23,580 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:02:23,581 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:02:23,581 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:23,617 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:23,685 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:02:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:23,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:23,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:23,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:23,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:23,906 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:23,953 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:23,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2525 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:24,039 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:24,208 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2525 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 5037 states and 14238 transitions. Complement of second has 8 states. [2022-07-22 12:02:24,210 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:24,218 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:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-07-22 12:02:24,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 198 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:24,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:24,224 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:02:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:24,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:24,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:24,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:24,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:24,383 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:24,384 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:24,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2525 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:24,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2525 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 5031 states and 14231 transitions. Complement of second has 10 states. [2022-07-22 12:02:24,538 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:24,539 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:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2022-07-22 12:02:24,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 199 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:24,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:24,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 199 transitions. Stem has 56 letters. Loop has 6 letters. [2022-07-22 12:02:24,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:24,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 199 transitions. Stem has 50 letters. Loop has 12 letters. [2022-07-22 12:02:24,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:24,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5031 states and 14231 transitions. [2022-07-22 12:02:24,624 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 2333 [2022-07-22 12:02:24,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5031 states to 2461 states and 6957 transitions. [2022-07-22 12:02:24,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2454 [2022-07-22 12:02:24,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2455 [2022-07-22 12:02:24,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2461 states and 6957 transitions. [2022-07-22 12:02:24,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:24,694 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2461 states and 6957 transitions. [2022-07-22 12:02:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states and 6957 transitions. [2022-07-22 12:02:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2022-07-22 12:02:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2461 states have (on average 2.826899634295002) internal successors, (6957), 2460 states have internal predecessors, (6957), 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:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 6957 transitions. [2022-07-22 12:02:24,902 INFO L242 hiAutomatonCegarLoop]: Abstraction has 2461 states and 6957 transitions. [2022-07-22 12:02:24,902 INFO L425 stractBuchiCegarLoop]: Abstraction has 2461 states and 6957 transitions. [2022-07-22 12:02:24,902 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:02:24,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2461 states and 6957 transitions. [2022-07-22 12:02:24,931 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 2333 [2022-07-22 12:02:24,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:24,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:24,935 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:24,936 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:24,940 INFO L748 eck$LassoCheckResult]: Stem: 18952#[ULTIMATE.startENTRY]don't care [372] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18954#[L-1]don't care [263] 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] 18994#[L-1-1]don't care [382] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 18996#[L-1-2]don't care [386] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 20268#[L21]don't care [338] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 19788#[L21-1]don't care [366] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 17260#[L21-2]don't care [272] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 17262#[L21-3]don't care [320] L21-3-->L21-4: Formula: (and (= 15 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 19724#[L21-4]don't care [295] L21-4-->L42: Formula: (and (= v_~f~0.offset_4 0) (= v_~f~0.base_4 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_4, ~f~0.offset=v_~f~0.offset_4} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 20520#[L42]don't care [284] L42-->L42-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] 20522#[L42-1]don't care [368] L42-1-->L42-2: Formula: (= v_~x2~0_7 0) InVars {} OutVars{~x2~0=v_~x2~0_7} AuxVars[] AssignedVars[~x2~0] 20430#[L42-2]don't care [293] L42-2-->L43: Formula: (= 0 v_~size~0_4) InVars {} OutVars{~size~0=v_~size~0_4} AuxVars[] AssignedVars[~size~0] 20252#[L43]don't care [374] L43-->L-1-3: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 19814#[L-1-3]don't care [392] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16014#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16016#[L-1-5]don't care [240] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 17586#[L-1-6]don't care [359] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 16300#[L71]don't care [308] L71-->L71-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 16302#[L71-1]don't care [245] L71-1-->L71-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 18306#[L71-2]don't care [385] L71-2-->L74: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 18308#[L74]don't care [307] L74-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 20184#[L75]don't care [289] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~size~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~size~0=v_~size~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~size~0] 19574#[L75-1]don't care [252] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 19576#[L76]don't care [299] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18908#[L76-1]don't care [364] L76-1-->L76-2: Formula: (= (ite (< 0 v_~size~0_6) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_6} OutVars{~size~0=v_~size~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 18910#[L76-2]don't care [375] L76-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 16148#[L37]don't care [286] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 16150#[L38]don't care [297] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 18644#[L37-1]don't care [287] L37-1-->L77: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20434#[L77]don't care [312] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20436#[L77-1]don't care [324] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_7) InVars {~size~0=v_~size~0_7} 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_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 19606#[L77-2]don't care [265] L77-2-->L77-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] 19608#[L77-3]don't care [314] L77-3-->L93: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 19892#[L93]don't care [257] L93-->L94: 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] 19894#[L94]don't care [369] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16362#[L94-1]don't care [313] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 16364#[L94-2]don't care [345] L94-2-->L37-2: 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] 16642#[L37-2]don't care [242] L37-2-->L38-3: 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] 18432#[L38-3]don't care [261] L38-3-->L37-3: 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[] 20318#[L37-3]don't care [253] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 17458#[L95]don't care [325] L95-->L95-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16592#[L95-1]don't care [342] L95-1-->L95-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_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 16594#[L95-2]don't care [343] L95-2-->L37-4: 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] 20018#[L37-4]don't care [355] L37-4-->L38-6: 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] 18158#[L38-6]don't care [336] L38-6-->L37-5: 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[] 16384#[L37-5]don't care [316] L37-5-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16386#[L97]don't care [310] L97-->L97-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4))) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1) |v_#valid_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 20202#[L97-1]don't care [319] L97-1-->L97-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 20640#[L97-2]don't care [379] L97-2-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 18862#[L98]don't care [344] L98-->L98-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] 18864#[L98-6]don't care [327] L98-6-->L98-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[] 18882#[L98-7]don't care [362] L98-7-->L101: 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] 18884#[L101]don't care [373] L101-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#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~ret9#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_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 20532#[L77-4]don't care [353] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20534#[L77-5]don't care [239] L77-5-->L77-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~f~0.base_5) (= v_~f~0.offset_5 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~f~0.base=v_~f~0.base_5, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ~f~0.offset=v_~f~0.offset_5} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 20560#[L77-6]don't care [234] L77-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 20616#[L79]don't care [279] L79-->L79-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20470#[L79-1]don't care [363] L79-1-->L79-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (< (mod v_~n~0_7 4294967296) 2147483648) 1 0)) InVars {~n~0=v_~n~0_7} OutVars{~n~0=v_~n~0_7, 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] 20424#[L79-2]don't care [259] L79-2-->L37-6: 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] 20426#[L37-6]don't care [303] L37-6-->L38-9: 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] 20626#[L38-9]don't care [377] L38-9-->L37-7: 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[] 18428#[L37-7]don't care [323] L37-7-->L82: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20372#[L82]don't care [330] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 20600#[L82-1]don't care [235] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 20270#[L82-2]don't care [389] L82-2-->L82-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 20272#[L82-3]don't care [453] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 17998#[L82-4, thread1ENTRY]don't care [394] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 16868#[L82-4, L49-2]don't care [2022-07-22 12:02:24,940 INFO L750 eck$LassoCheckResult]: Loop: 16868#[L82-4, L49-2]don't care [397] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_5| 4294967296) (mod (* 2 v_~n~0_2) 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} AuxVars[] AssignedVars[] 16280#[L50, L82-4]don't care [399] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16284#[L50-1, L82-4]don't care [401] L50-1-->L50-2: Formula: (= (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 20420#[L50-2, L82-4]don't care [402] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 20590#[L37, L82-4]don't care [403] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 20496#[L38, L82-4]don't care [405] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 20500#[L37-1, L82-4]don't care [407] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20504#[L82-4, L51]don't care [408] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) (<= (+ .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|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 15828#[L82-4, L51-1]don't care [409] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork1_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 15830#[L51-2, L82-4]don't care [410] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 20630#[L52, L82-4]don't care [411] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_7|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 19778#[L82-4, L52-1]don't care [412] L52-1-->L52-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_9| (+ |v_thread1Thread1of1ForFork1_#t~post2#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 19780#[L82-4, L52-2]don't care [413] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 16868#[L82-4, L49-2]don't care [2022-07-22 12:02:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2004152617, now seen corresponding path program 1 times [2022-07-22 12:02:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:24,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891639311] [2022-07-22 12:02:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:24,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:25,176 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:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:02:25,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891639311] [2022-07-22 12:02:25,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891639311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:02:25,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:02:25,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 12:02:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678526443] [2022-07-22 12:02:25,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:02:25,188 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:02:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1056675444, now seen corresponding path program 1 times [2022-07-22 12:02:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:25,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999857475] [2022-07-22 12:02:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:02:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 12:02:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 12:02:25,392 INFO L87 Difference]: Start difference. First operand 2461 states and 6957 transitions. cyclomatic complexity: 4542 Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:02:25,526 INFO L93 Difference]: Finished difference Result 2465 states and 6501 transitions. [2022-07-22 12:02:25,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2465 states and 6501 transitions. [2022-07-22 12:02:25,560 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 2265 [2022-07-22 12:02:25,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2465 states to 2414 states and 6367 transitions. [2022-07-22 12:02:25,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2404 [2022-07-22 12:02:25,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2404 [2022-07-22 12:02:25,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2414 states and 6367 transitions. [2022-07-22 12:02:25,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:25,603 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2414 states and 6367 transitions. [2022-07-22 12:02:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states and 6367 transitions. [2022-07-22 12:02:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2410. [2022-07-22 12:02:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2410 states have (on average 2.6402489626556016) internal successors, (6363), 2409 states have internal predecessors, (6363), 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:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 6363 transitions. [2022-07-22 12:02:25,688 INFO L242 hiAutomatonCegarLoop]: Abstraction has 2410 states and 6363 transitions. [2022-07-22 12:02:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 12:02:25,689 INFO L425 stractBuchiCegarLoop]: Abstraction has 2410 states and 6363 transitions. [2022-07-22 12:02:25,690 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:02:25,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2410 states and 6363 transitions. [2022-07-22 12:02:25,716 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 2265 [2022-07-22 12:02:25,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:25,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:25,718 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, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:25,718 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:25,720 INFO L748 eck$LassoCheckResult]: Stem: 26228#[ULTIMATE.startENTRY]don't care [372] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26230#[L-1]don't care [263] 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] 26272#[L-1-1]don't care [382] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 26274#[L-1-2]don't care [386] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 27542#[L21]don't care [338] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 27048#[L21-1]don't care [366] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 24596#[L21-2]don't care [272] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 24598#[L21-3]don't care [320] L21-3-->L21-4: Formula: (and (= 15 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 26982#[L21-4]don't care [295] L21-4-->L42: Formula: (and (= v_~f~0.offset_4 0) (= v_~f~0.base_4 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_4, ~f~0.offset=v_~f~0.offset_4} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 27818#[L42]don't care [284] L42-->L42-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] 27820#[L42-1]don't care [368] L42-1-->L42-2: Formula: (= v_~x2~0_7 0) InVars {} OutVars{~x2~0=v_~x2~0_7} AuxVars[] AssignedVars[~x2~0] 27718#[L42-2]don't care [293] L42-2-->L43: Formula: (= 0 v_~size~0_4) InVars {} OutVars{~size~0=v_~size~0_4} AuxVars[] AssignedVars[~size~0] 27526#[L43]don't care [374] L43-->L-1-3: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 27072#[L-1-3]don't care [392] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23392#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23394#[L-1-5]don't care [240] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 24912#[L-1-6]don't care [359] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 23658#[L71]don't care [308] L71-->L71-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 23660#[L71-1]don't care [245] L71-1-->L71-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 25618#[L71-2]don't care [385] L71-2-->L74: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 25620#[L74]don't care [307] L74-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 27452#[L75]don't care [289] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~size~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~size~0=v_~size~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~size~0] 26838#[L75-1]don't care [252] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 26840#[L76]don't care [299] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26188#[L76-1]don't care [364] L76-1-->L76-2: Formula: (= (ite (< 0 v_~size~0_6) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_6} OutVars{~size~0=v_~size~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 26190#[L76-2]don't care [375] L76-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 23518#[L37]don't care [286] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 23520#[L38]don't care [297] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 25936#[L37-1]don't care [287] L37-1-->L77: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27724#[L77]don't care [312] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27726#[L77-1]don't care [324] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_7) InVars {~size~0=v_~size~0_7} 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_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 26870#[L77-2]don't care [265] L77-2-->L77-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] 26872#[L77-3]don't care [314] L77-3-->L93: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 27148#[L93]don't care [257] L93-->L94: 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] 27150#[L94]don't care [369] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23724#[L94-1]don't care [313] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 23726#[L94-2]don't care [345] L94-2-->L37-2: 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] 23996#[L37-2]don't care [242] L37-2-->L38-3: 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] 25746#[L38-3]don't care [261] L38-3-->L37-3: 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[] 27600#[L37-3]don't care [253] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24792#[L95]don't care [325] L95-->L95-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23942#[L95-1]don't care [342] L95-1-->L95-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_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 23944#[L95-2]don't care [343] L95-2-->L37-4: 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] 27276#[L37-4]don't care [355] L37-4-->L38-6: 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] 25472#[L38-6]don't care [336] L38-6-->L37-5: 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[] 23746#[L37-5]don't care [316] L37-5-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23748#[L97]don't care [310] L97-->L97-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4))) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1) |v_#valid_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 27472#[L97-1]don't care [319] L97-1-->L97-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 27944#[L97-2]don't care [379] L97-2-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 26144#[L98]don't care [344] L98-->L98-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] 26146#[L98-6]don't care [328] L98-6-->L99: 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[] 26692#[L99]don't care [352] L99-->L99-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) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_6|)))) 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|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} 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|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 26486#[L99-1]don't care [271] L99-1-->L98-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 26488#[L98-3]don't care [340] L98-3-->L98-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#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_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 26032#[L98-4]don't care [315] L98-4-->L98-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 26034#[L98-5]don't care [288] L98-5-->L98-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 27450#[L98-6]don't care [327] L98-6-->L98-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[] 26164#[L98-7]don't care [362] L98-7-->L101: 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] 26166#[L101]don't care [373] L101-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#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~ret9#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_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 27832#[L77-4]don't care [353] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27834#[L77-5]don't care [239] L77-5-->L77-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~f~0.base_5) (= v_~f~0.offset_5 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~f~0.base=v_~f~0.base_5, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ~f~0.offset=v_~f~0.offset_5} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 27860#[L77-6]don't care [234] L77-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 27920#[L79]don't care [279] L79-->L79-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27764#[L79-1]don't care [363] L79-1-->L79-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (< (mod v_~n~0_7 4294967296) 2147483648) 1 0)) InVars {~n~0=v_~n~0_7} OutVars{~n~0=v_~n~0_7, 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] 27708#[L79-2]don't care [259] L79-2-->L37-6: 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] 27710#[L37-6]don't care [303] L37-6-->L38-9: 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] 27930#[L38-9]don't care [377] L38-9-->L37-7: 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[] 27658#[L37-7]don't care [323] L37-7-->L82: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27660#[L82]don't care [330] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 27902#[L82-1]don't care [235] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 27544#[L82-2]don't care [389] L82-2-->L82-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 27546#[L82-3]don't care [453] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 25312#[L82-4, thread1ENTRY]don't care [394] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 24216#[L82-4, L49-2]don't care [2022-07-22 12:02:25,720 INFO L750 eck$LassoCheckResult]: Loop: 24216#[L82-4, L49-2]don't care [397] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_5| 4294967296) (mod (* 2 v_~n~0_2) 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} AuxVars[] AssignedVars[] 23652#[L50, L82-4]don't care [399] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23656#[L50-1, L82-4]don't care [401] L50-1-->L50-2: Formula: (= (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 27712#[L50-2, L82-4]don't care [402] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 27892#[L37, L82-4]don't care [403] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 27792#[L38, L82-4]don't care [405] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 27796#[L37-1, L82-4]don't care [407] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27800#[L82-4, L51]don't care [408] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) (<= (+ .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|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 23226#[L82-4, L51-1]don't care [409] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork1_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 23228#[L51-2, L82-4]don't care [410] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 27934#[L52, L82-4]don't care [411] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_7|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 27038#[L82-4, L52-1]don't care [412] L52-1-->L52-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_9| (+ |v_thread1Thread1of1ForFork1_#t~post2#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 27040#[L82-4, L52-2]don't care [413] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 24216#[L82-4, L49-2]don't care [2022-07-22 12:02:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1477521323, now seen corresponding path program 1 times [2022-07-22 12:02:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:25,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532334995] [2022-07-22 12:02:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1056675444, now seen corresponding path program 2 times [2022-07-22 12:02:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:25,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721168372] [2022-07-22 12:02:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1167790432, now seen corresponding path program 1 times [2022-07-22 12:02:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:25,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584691422] [2022-07-22 12:02:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:25,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:28,104 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:28,104 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:28,104 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:28,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:28,105 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:28,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:28,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:28,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:28,105 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-2.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:02:28,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:28,105 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:28,113 INFO L141 MapEliminator]: 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:28,118 INFO L141 MapEliminator]: 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:28,122 INFO L141 MapEliminator]: 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:28,124 INFO L141 MapEliminator]: 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:28,127 INFO L141 MapEliminator]: 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:28,129 INFO L141 MapEliminator]: 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:28,131 INFO L141 MapEliminator]: 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:28,133 INFO L141 MapEliminator]: 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:28,137 INFO L141 MapEliminator]: 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:28,148 INFO L141 MapEliminator]: 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:28,150 INFO L141 MapEliminator]: 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:28,153 INFO L141 MapEliminator]: 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:28,155 INFO L141 MapEliminator]: 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:28,158 INFO L141 MapEliminator]: 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:28,161 INFO L141 MapEliminator]: 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:28,163 INFO L141 MapEliminator]: 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:28,165 INFO L141 MapEliminator]: 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:28,168 INFO L141 MapEliminator]: 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:28,170 INFO L141 MapEliminator]: 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:28,171 INFO L141 MapEliminator]: 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:28,392 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:28,397 INFO L158 Benchmark]: Toolchain (without parser) took 10417.98ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 125.6MB in the beginning and 164.2MB in the end (delta: -38.6MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-07-22 12:02:28,397 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:02:28,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.39ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:02:28,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.27ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 112.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:28,399 INFO L158 Benchmark]: Boogie Preprocessor took 33.75ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 110.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:28,400 INFO L158 Benchmark]: RCFGBuilder took 651.30ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 129.3MB in the end (delta: -18.8MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:28,401 INFO L158 Benchmark]: BuchiAutomizer took 9363.10ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 129.3MB in the beginning and 164.2MB in the end (delta: -34.9MB). Peak memory consumption was 122.9MB. Max. memory is 8.0GB. [2022-07-22 12:02:28,404 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.26ms. Allocated memory is still 151.0MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.39ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.27ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 112.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.75ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 110.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 651.30ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 129.3MB in the end (delta: -18.8MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 9363.10ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 129.3MB in the beginning and 164.2MB in the end (delta: -34.9MB). Peak memory consumption was 122.9MB. 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:28,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...