/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/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:57:00,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:57:00,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:57:00,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:57:00,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:57:00,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:57:00,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:57:00,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:57:00,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:57:00,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:57:00,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:57:00,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:57:00,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:57:00,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:57:00,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:57:00,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:57:00,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:57:00,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:57:00,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:57:00,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:57:00,324 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:57:00,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:57:00,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:57:00,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:57:00,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:57:00,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:57:00,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:57:00,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:57:00,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:57:00,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:57:00,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:57:00,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:57:00,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:57:00,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:57:00,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:57:00,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:57:00,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:57:00,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:57:00,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:57:00,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:57:00,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:57:00,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:57:00,346 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 11:57:00,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:57:00,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:57:00,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:57:00,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:57:00,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:57:00,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:57:00,396 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:57:00,396 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:57:00,396 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:57:00,396 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:57:00,397 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:57:00,398 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:57:00,398 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:57:00,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:57:00,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:57:00,398 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:57:00,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:57:00,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:57:00,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:57:00,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:57:00,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:57:00,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:57:00,400 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:57:00,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:57:00,400 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:57:00,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:57:00,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:57:00,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:57:00,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:57:00,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:57:00,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:57:00,402 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:57:00,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:57:00,405 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 11:57:00,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:57:00,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:57:00,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:57:00,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:57:00,814 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:57:00,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-07-22 11:57:00,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d63133c/923e9922d06f451c8752693ea8f299ff/FLAG282a471f4 [2022-07-22 11:57:01,579 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:57:01,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-07-22 11:57:01,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d63133c/923e9922d06f451c8752693ea8f299ff/FLAG282a471f4 [2022-07-22 11:57:01,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d63133c/923e9922d06f451c8752693ea8f299ff [2022-07-22 11:57:01,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:57:01,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:57:01,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:57:01,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:57:01,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:57:01,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:57:01" (1/1) ... [2022-07-22 11:57:01,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17efa56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:01, skipping insertion in model container [2022-07-22 11:57:01,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:57:01" (1/1) ... [2022-07-22 11:57:01,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:57:02,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:57:02,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-07-22 11:57:02,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:57:02,285 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:57:02,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-07-22 11:57:02,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:57:02,381 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:57:02,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02 WrapperNode [2022-07-22 11:57:02,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:57:02,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:57:02,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:57:02,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:57:02,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,479 INFO L137 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 185 [2022-07-22 11:57:02,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:57:02,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:57:02,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:57:02,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:57:02,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:57:02,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:57:02,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:57:02,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:57:02,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (1/1) ... [2022-07-22 11:57:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:02,628 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 11:57:02,649 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 11:57:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:57:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:57:02,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:57:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 11:57:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 11:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:57:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:57:02,714 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 11:57:02,839 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:57:02,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:57:03,301 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:57:03,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:57:03,472 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 11:57:03,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:57:03 BoogieIcfgContainer [2022-07-22 11:57:03,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:57:03,476 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:57:03,476 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:57:03,480 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:57:03,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:57:03,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:57:01" (1/3) ... [2022-07-22 11:57:03,482 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@241bc347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:57:03, skipping insertion in model container [2022-07-22 11:57:03,482 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:57:03,482 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:57:02" (2/3) ... [2022-07-22 11:57:03,483 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@241bc347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:57:03, skipping insertion in model container [2022-07-22 11:57:03,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:57:03,483 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:57:03" (3/3) ... [2022-07-22 11:57:03,484 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-07-22 11:57:03,584 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 11:57:03,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 152 transitions, 328 flow [2022-07-22 11:57:03,684 INFO L129 PetriNetUnfolder]: 12/146 cut-off events. [2022-07-22 11:57:03,685 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 11:57:03,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 12/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-07-22 11:57:03,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 152 transitions, 328 flow [2022-07-22 11:57:03,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2022-07-22 11:57:03,720 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:57:03,720 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:57:03,720 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:57:03,720 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:57:03,721 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:57:03,721 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:57:03,721 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:57:03,721 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:57:03,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:57:04,462 INFO L131 ngComponentsAnalysis]: Automaton has 335 accepting balls. 3296 [2022-07-22 11:57:04,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:04,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:04,470 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] [2022-07-22 11:57:04,470 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:57:04,471 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:57:04,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 3814 states, but on-demand construction may add more states [2022-07-22 11:57:04,566 INFO L131 ngComponentsAnalysis]: Automaton has 335 accepting balls. 3296 [2022-07-22 11:57:04,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:04,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:04,569 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] [2022-07-22 11:57:04,569 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:57:04,577 INFO L748 eck$LassoCheckResult]: Stem: 150#[ULTIMATE.startENTRY]don't care [527] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 153#[L-1]don't care [440] 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] 155#[L-1-1]don't care [534] L-1-1-->L-1-2: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 157#[L-1-2]don't care [535] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 159#[L21]don't care [496] L21-->L21-1: Formula: (and (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 161#[L21-1]don't care [522] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 163#[L21-2]don't care [451] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 165#[L21-3]don't care [486] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_11| 2) 33)) InVars {#length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 167#[L21-4]don't care [465] L21-4-->L41: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 169#[L41]don't care [429] L41-->L41-1: Formula: (= v_~res1~0_4 0) InVars {} OutVars{~res1~0=v_~res1~0_4} AuxVars[] AssignedVars[~res1~0] 171#[L41-1]don't care [441] L41-1-->L41-2: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 173#[L41-2]don't care [453] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 175#[L41-3]don't care [520] L41-3-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 177#[L-1-3]don't care [538] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 179#[L-1-4]don't care [446] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 181#[L-1-5]don't care [415] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 183#[L-1-6]don't care [515] L-1-6-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 185#[L77]don't care [476] L77-->L77-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 187#[L77-1]don't care [488] L77-1-->L77-2: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_21|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 189#[L77-2]don't care [444] L77-2-->L77-3: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 191#[L77-3]don't care [481] L77-3-->L80: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~M~0] 193#[L80]don't care [405] L80-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 195#[L81]don't care [531] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 197#[L81-1]don't care [399] L81-1-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 199#[L82]don't care [490] L82-->L82-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 201#[L82-1]don't care [406] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 203#[L82-2]don't care [536] L82-2-->L82-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] 205#[L82-3]don't care [410] L82-3-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 207#[L100]don't care [456] L100-->L101: 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] 209#[L101]don't care [528] L101-->L101-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 211#[L101-1]don't care [420] L101-1-->L101-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] 213#[L101-2]don't care [484] L101-2-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 215#[L36]don't care [532] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) 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_7|, 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] 217#[L37]don't care [458] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 221#[L36-1]don't care [519] L36-1-->L102: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 223#[L102]don't care [447] L102-->L102-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 225#[L102-1]don't care [421] L102-1-->L102-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] 227#[L102-2]don't care [445] L102-2-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 229#[L36-2]don't care [509] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 231#[L37-3]don't care [435] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[] 235#[L36-3]don't care [474] L36-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 237#[L104]don't care [419] L104-->L104-1: Formula: (and (= (store |v_#length_19| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_18|) (= (select |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_5|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_25|, #length=|v_#length_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 239#[L104-1]don't care [539] L104-1-->L104-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 241#[L104-2]don't care [541] L104-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 243#[L105]don't care [418] L105-->L105-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 245#[L105-6]don't care [2022-07-22 11:57:04,578 INFO L750 eck$LassoCheckResult]: Loop: 245#[L105-6]don't care [403] L105-6-->L106: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 249#[L106]don't care [524] L106-->L106-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (select |v_#valid_27| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} AuxVars[] AssignedVars[#memory_int] 253#[L106-1]don't care [516] L106-1-->L105-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet24#1] 257#[L105-3]don't care [537] L105-3-->L105-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 261#[L105-4]don't care [454] L105-4-->L105-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 265#[L105-5]don't care [491] L105-5-->L105-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 245#[L105-6]don't care [2022-07-22 11:57:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2032020027, now seen corresponding path program 1 times [2022-07-22 11:57:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:04,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639276428] [2022-07-22 11:57:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:04,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:04,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash 39977428, now seen corresponding path program 1 times [2022-07-22 11:57:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:04,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442243333] [2022-07-22 11:57:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:04,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:04,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 739603608, now seen corresponding path program 1 times [2022-07-22 11:57:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:04,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542760824] [2022-07-22 11:57:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:04,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:04,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:06,575 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:06,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:06,576 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:06,576 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:06,576 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:06,576 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:06,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:06,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:06,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-array-sum-alt2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 11:57:06,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:06,577 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:06,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:06,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,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 11:57:07,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,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 11:57:07,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,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 11:57:07,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 11:57:07,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 11:57:07,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 11:57:07,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:07,637 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:07,644 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:57:07,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:07,649 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 11:57:07,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:07,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:07,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:07,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:07,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:07,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:07,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:07,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:07,679 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 11:57:07,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:07,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 11:57:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:07,724 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 11:57:07,725 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 11:57:07,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:07,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:07,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:07,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:07,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:07,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:07,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:07,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:07,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:07,770 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 11:57:07,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:07,772 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 11:57:07,772 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 11:57:07,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:07,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:07,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:07,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:07,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:07,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:07,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:07,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:07,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:07,813 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 11:57:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:07,818 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 11:57:07,820 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 11:57:07,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:07,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:07,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:07,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:07,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:07,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:07,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:07,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:07,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:07,885 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 11:57:07,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:07,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:07,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:07,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:07,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:07,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:07,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:07,916 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 11:57:07,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:07,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:07,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:07,942 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 11:57:07,943 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 11:57:07,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:07,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:07,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:07,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:07,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:07,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:07,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:07,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:07,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:07,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 11:57:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,000 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 11:57:08,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,012 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 11:57:08,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,070 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 11:57:08,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,072 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 11:57:08,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:08,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,086 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 11:57:08,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,126 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 11:57:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,128 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 11:57:08,129 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 11:57:08,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,163 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 11:57:08,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,165 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 11:57:08,166 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 11:57:08,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,223 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 11:57:08,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,224 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 11:57:08,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,245 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 11:57:08,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,290 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 11:57:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,292 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 11:57:08,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,302 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 11:57:08,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,359 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 11:57:08,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,361 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 11:57:08,366 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 11:57:08,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:08,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,428 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 11:57:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,430 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 11:57:08,432 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 11:57:08,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,465 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 11:57:08,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,467 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 11:57:08,470 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 11:57:08,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,513 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 11:57:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,515 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 11:57:08,516 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 11:57:08,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 11:57:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,572 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 11:57:08,573 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 11:57:08,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:08,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,607 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 11:57:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,610 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 11:57:08,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 11:57:08,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,653 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 11:57:08,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:08,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,733 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:08,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 11:57:08,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:08,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,783 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 11:57:08,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:08,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,822 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 11:57:08,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:08,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 11:57:08,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,857 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 11:57:08,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:08,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:08,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:08,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:08,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:08,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,917 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 11:57:08,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:08,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 11:57:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:08,978 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:08,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 11:57:08,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:08,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:08,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:08,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:08,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:08,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:08,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:08,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,018 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 11:57:09,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,058 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 11:57:09,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 11:57:09,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,099 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 11:57:09,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 11:57:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,140 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 11:57:09,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 11:57:09,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,186 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 11:57:09,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 11:57:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,246 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 11:57:09,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:09,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 11:57:09,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,284 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 11:57:09,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 11:57:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,324 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 11:57:09,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:09,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:09,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:09,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,360 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 11:57:09,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:09,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,398 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 11:57:09,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,450 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 11:57:09,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,488 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 11:57:09,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,538 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 11:57:09,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:09,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:09,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:09,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 11:57:09,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,574 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 11:57:09,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:09,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,645 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 11:57:09,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:09,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:09,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:09,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:09,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:09,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:09,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 11:57:09,684 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:57:09,719 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 11:57:09,719 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 11:57:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:09,728 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:09,730 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:57:09,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 11:57:09,764 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:57:09,764 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:57:09,765 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 11:57:09,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 11:57:09,899 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 11:57:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:09,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:10,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:10,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:10,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:10,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 11:57:10,220 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 11:57:10,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 3814 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 11:57:10,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 3814 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 7608 states and 29025 transitions. Complement of second has 8 states. [2022-07-22 11:57:10,478 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 11:57:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 11:57:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2022-07-22 11:57:10,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 165 transitions. Stem has 45 letters. Loop has 6 letters. [2022-07-22 11:57:10,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:10,489 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:57:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:10,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:10,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:10,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:10,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:10,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:10,715 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 11:57:10,716 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 11:57:10,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 3814 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 11:57:10,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 3814 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 7602 states and 29018 transitions. Complement of second has 10 states. [2022-07-22 11:57:10,965 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 11:57:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 11:57:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-07-22 11:57:10,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 166 transitions. Stem has 45 letters. Loop has 6 letters. [2022-07-22 11:57:10,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:10,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 166 transitions. Stem has 51 letters. Loop has 6 letters. [2022-07-22 11:57:10,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:10,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 166 transitions. Stem has 45 letters. Loop has 12 letters. [2022-07-22 11:57:10,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:10,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7602 states and 29018 transitions. [2022-07-22 11:57:11,138 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 3290 [2022-07-22 11:57:11,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7602 states to 3650 states and 13865 transitions. [2022-07-22 11:57:11,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3643 [2022-07-22 11:57:11,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3644 [2022-07-22 11:57:11,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 13865 transitions. [2022-07-22 11:57:11,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:57:11,256 INFO L220 hiAutomatonCegarLoop]: Abstraction has 3650 states and 13865 transitions. [2022-07-22 11:57:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 13865 transitions. [2022-07-22 11:57:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2022-07-22 11:57:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 3.7986301369863016) internal successors, (13865), 3649 states have internal predecessors, (13865), 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 11:57:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 13865 transitions. [2022-07-22 11:57:11,690 INFO L242 hiAutomatonCegarLoop]: Abstraction has 3650 states and 13865 transitions. [2022-07-22 11:57:11,690 INFO L425 stractBuchiCegarLoop]: Abstraction has 3650 states and 13865 transitions. [2022-07-22 11:57:11,691 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:57:11,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 13865 transitions. [2022-07-22 11:57:11,808 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 3290 [2022-07-22 11:57:11,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:11,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:11,811 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] [2022-07-22 11:57:11,811 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:11,812 INFO L748 eck$LassoCheckResult]: Stem: 30582#[ULTIMATE.startENTRY]don't care [527] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30584#[L-1]don't care [440] 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] 26658#[L-1-1]don't care [534] L-1-1-->L-1-2: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 26660#[L-1-2]don't care [535] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 30196#[L21]don't care [496] L21-->L21-1: Formula: (and (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 27834#[L21-1]don't care [522] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 24752#[L21-2]don't care [451] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 24754#[L21-3]don't care [486] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_11| 2) 33)) InVars {#length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 29838#[L21-4]don't care [465] L21-4-->L41: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 29840#[L41]don't care [429] L41-->L41-1: Formula: (= v_~res1~0_4 0) InVars {} OutVars{~res1~0=v_~res1~0_4} AuxVars[] AssignedVars[~res1~0] 27568#[L41-1]don't care [441] L41-1-->L41-2: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 27570#[L41-2]don't care [453] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 30706#[L41-3]don't care [520] L41-3-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 27862#[L-1-3]don't care [538] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27864#[L-1-4]don't care [446] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30374#[L-1-5]don't care [415] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 30502#[L-1-6]don't care [515] L-1-6-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 29268#[L77]don't care [476] L77-->L77-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 29270#[L77-1]don't care [488] L77-1-->L77-2: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_21|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 29500#[L77-2]don't care [444] L77-2-->L77-3: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 30628#[L77-3]don't care [481] L77-3-->L80: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~M~0] 24522#[L80]don't care [405] L80-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 24524#[L81]don't care [531] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 27882#[L81-1]don't care [399] L81-1-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 27884#[L82]don't care [490] L82-->L82-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30710#[L82-1]don't care [406] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 30682#[L82-2]don't care [536] L82-2-->L82-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] 30684#[L82-3]don't care [410] L82-3-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 30466#[L100]don't care [456] L100-->L101: 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] 30468#[L101]don't care [528] L101-->L101-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30624#[L101-1]don't care [420] L101-1-->L101-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] 30178#[L101-2]don't care [484] L101-2-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 29906#[L36]don't care [532] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) 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_7|, 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] 29908#[L37]don't care [458] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 30392#[L36-1]don't care [519] L36-1-->L102: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 25620#[L102]don't care [447] L102-->L102-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 25622#[L102-1]don't care [421] L102-1-->L102-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] 30600#[L102-2]don't care [445] L102-2-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 29348#[L36-2]don't care [509] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 29350#[L37-3]don't care [435] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[] 30014#[L36-3]don't care [474] L36-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30016#[L104]don't care [419] L104-->L104-1: Formula: (and (= (store |v_#length_19| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_18|) (= (select |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_5|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_25|, #length=|v_#length_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 30120#[L104-1]don't care [539] L104-1-->L104-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 30510#[L104-2]don't care [541] L104-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 30588#[L105]don't care [418] L105-->L105-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 30716#[L105-6]don't care [402] L105-6-->L105-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 30712#[L105-7]don't care [523] L105-7-->L108: 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] 28824#[L108]don't care [422] L108-->L82-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) 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_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 28826#[L82-4]don't care [492] L82-4-->L82-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30450#[L82-5]don't care [438] L82-5-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_5) (= v_~A~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 28608#[L82-6]don't care [482] L82-6-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 28610#[L84]don't care [525] L84-->L84-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 29556#[L84-1]don't care [533] L84-1-->L84-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (<= v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ~M~0=v_~M~0_6, 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] 29558#[L84-2]don't care [430] L84-2-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 30594#[L36-4]don't care [428] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) 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_15|, 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] 30696#[L37-6]don't care [470] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 30688#[L36-5]don't care [449] L36-5-->L87: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30526#[L87]don't care [455] L87-->L87-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 30528#[L87-1]don't care [404] L87-1-->L87-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 23434#[L87-2]don't care [398] L87-2-->L87-3: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= |v_#memory_int_4| (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre13#1_2|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_5|, #length=|v_#length_4|, 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|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, #length=|v_#length_4|, 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|} AuxVars[] AssignedVars[#memory_int] 23436#[L87-3]don't care [577] L87-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 24584#[L87-4, thread1ENTRY]don't care [542] thread1ENTRY-->L47-4: 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] 27792#[L47-4, L87-4]don't care [2022-07-22 11:57:11,813 INFO L750 eck$LassoCheckResult]: Loop: 27792#[L47-4, L87-4]don't care [545] L47-4-->L48: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 27796#[L87-4, L48]don't care [547] L48-->L50: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4))) (let ((.cse1 (+ .cse2 v_~A~0.offset_36)) (.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|))) (and (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (select |v_#valid_58| v_~A~0.base_36) 1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| v_~res1~0_25) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~res1~0_26) (<= (+ .cse2 v_~A~0.offset_36 4) (select |v_#length_51| v_~A~0.base_36)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_47| v_~A~0.base_36) .cse1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| |v_thread1Thread1of1ForFork1_plus_~a#1_1|) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_1|)))) InVars {~res1~0=v_~res1~0_26, ~A~0.base=v_~A~0.base_36, ~A~0.offset=v_~A~0.offset_36, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_47|, #length=|v_#length_51|} OutVars{~res1~0=v_~res1~0_25, ~A~0.base=v_~A~0.base_36, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.offset=v_~A~0.offset_36, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_47|, #length=|v_#length_51|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 28778#[L87-4, L50]don't care [549] L50-->L47-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 27842#[L87-4, L47-2]don't care [550] L47-2-->L47-3: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 27846#[L47-3, L87-4]don't care [551] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 27792#[L47-4, L87-4]don't care [2022-07-22 11:57:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash -956651107, now seen corresponding path program 1 times [2022-07-22 11:57:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:11,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656897052] [2022-07-22 11:57:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:11,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:11,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash 548788963, now seen corresponding path program 1 times [2022-07-22 11:57:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:11,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715198919] [2022-07-22 11:57:11,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:11,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:12,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 321966791, now seen corresponding path program 1 times [2022-07-22 11:57:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:12,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356815284] [2022-07-22 11:57:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:12,247 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 11:57:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:57:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356815284] [2022-07-22 11:57:12,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356815284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:57:12,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:57:12,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 11:57:12,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445897857] [2022-07-22 11:57:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:57:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:57:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 11:57:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:57:12,410 INFO L87 Difference]: Start difference. First operand 3650 states and 13865 transitions. cyclomatic complexity: 10550 Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 11:57:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:57:12,669 INFO L93 Difference]: Finished difference Result 5716 states and 19710 transitions. [2022-07-22 11:57:12,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5716 states and 19710 transitions. [2022-07-22 11:57:12,854 INFO L131 ngComponentsAnalysis]: Automaton has 574 accepting balls. 4950 [2022-07-22 11:57:12,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5716 states to 5642 states and 19474 transitions. [2022-07-22 11:57:12,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5632 [2022-07-22 11:57:12,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5632 [2022-07-22 11:57:12,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5642 states and 19474 transitions. [2022-07-22 11:57:12,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:57:12,996 INFO L220 hiAutomatonCegarLoop]: Abstraction has 5642 states and 19474 transitions. [2022-07-22 11:57:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states and 19474 transitions. [2022-07-22 11:57:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 4360. [2022-07-22 11:57:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4360 states, 4360 states have (on average 3.5256880733944955) internal successors, (15372), 4359 states have internal predecessors, (15372), 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 11:57:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 15372 transitions. [2022-07-22 11:57:13,302 INFO L242 hiAutomatonCegarLoop]: Abstraction has 4360 states and 15372 transitions. [2022-07-22 11:57:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 11:57:13,304 INFO L425 stractBuchiCegarLoop]: Abstraction has 4360 states and 15372 transitions. [2022-07-22 11:57:13,304 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 11:57:13,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4360 states and 15372 transitions. [2022-07-22 11:57:13,341 INFO L131 ngComponentsAnalysis]: Automaton has 418 accepting balls. 3870 [2022-07-22 11:57:13,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:13,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:13,342 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] [2022-07-22 11:57:13,343 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:13,344 INFO L748 eck$LassoCheckResult]: Stem: 44062#[ULTIMATE.startENTRY]don't care [527] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44064#[L-1]don't care [440] 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] 39690#[L-1-1]don't care [534] L-1-1-->L-1-2: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 39692#[L-1-2]don't care [535] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 43502#[L21]don't care [496] L21-->L21-1: Formula: (and (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 40918#[L21-1]don't care [522] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 37766#[L21-2]don't care [451] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 37768#[L21-3]don't care [486] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_11| 2) 33)) InVars {#length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 43074#[L21-4]don't care [465] L21-4-->L41: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 43076#[L41]don't care [429] L41-->L41-1: Formula: (= v_~res1~0_4 0) InVars {} OutVars{~res1~0=v_~res1~0_4} AuxVars[] AssignedVars[~res1~0] 40646#[L41-1]don't care [441] L41-1-->L41-2: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 40648#[L41-2]don't care [453] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 44358#[L41-3]don't care [520] L41-3-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 40946#[L-1-3]don't care [538] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 40948#[L-1-4]don't care [446] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43726#[L-1-5]don't care [415] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 43912#[L-1-6]don't care [515] L-1-6-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 42432#[L77]don't care [476] L77-->L77-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 42434#[L77-1]don't care [488] L77-1-->L77-2: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_21|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 42696#[L77-2]don't care [444] L77-2-->L77-3: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 44142#[L77-3]don't care [481] L77-3-->L80: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~M~0] 37546#[L80]don't care [405] L80-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 37548#[L81]don't care [531] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 40966#[L81-1]don't care [399] L81-1-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 40968#[L82]don't care [490] L82-->L82-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44378#[L82-1]don't care [406] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 44266#[L82-2]don't care [536] L82-2-->L82-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] 44268#[L82-3]don't care [410] L82-3-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 43858#[L100]don't care [456] L100-->L101: 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] 43860#[L101]don't care [528] L101-->L101-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44136#[L101-1]don't care [420] L101-1-->L101-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] 43478#[L101-2]don't care [484] L101-2-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 43150#[L36]don't care [532] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) 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_7|, 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] 43152#[L37]don't care [458] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 43742#[L36-1]don't care [519] L36-1-->L102: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 38640#[L102]don't care [447] L102-->L102-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 38642#[L102-1]don't care [421] L102-1-->L102-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] 44094#[L102-2]don't care [445] L102-2-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 42514#[L36-2]don't care [509] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 42516#[L37-3]don't care [435] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[] 43284#[L36-3]don't care [474] L36-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43286#[L104]don't care [419] L104-->L104-1: Formula: (and (= (store |v_#length_19| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_18|) (= (select |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_5|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_25|, #length=|v_#length_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 43404#[L104-1]don't care [539] L104-1-->L104-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 43924#[L104-2]don't care [541] L104-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 44076#[L105]don't care [418] L105-->L105-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 44432#[L105-6]don't care [402] L105-6-->L105-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 44384#[L105-7]don't care [523] L105-7-->L108: 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] 41950#[L108]don't care [422] L108-->L82-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) 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_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 41952#[L82-4]don't care [492] L82-4-->L82-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43834#[L82-5]don't care [438] L82-5-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_5) (= v_~A~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 41734#[L82-6]don't care [482] L82-6-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 41736#[L84]don't care [525] L84-->L84-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42760#[L84-1]don't care [533] L84-1-->L84-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (<= v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ~M~0=v_~M~0_6, 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] 42762#[L84-2]don't care [430] L84-2-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 44084#[L36-4]don't care [428] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) 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_15|, 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] 44310#[L37-6]don't care [470] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 44400#[L36-5]don't care [449] L36-5-->L87: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43956#[L87]don't care [455] L87-->L87-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 43958#[L87-1]don't care [404] L87-1-->L87-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 36470#[L87-2]don't care [398] L87-2-->L87-3: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= |v_#memory_int_4| (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre13#1_2|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_5|, #length=|v_#length_4|, 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|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, #length=|v_#length_4|, 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|} AuxVars[] AssignedVars[#memory_int] 36472#[L87-3]don't care [577] L87-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 37618#[L87-4, thread1ENTRY]don't care [436] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 42560#[L87-5, thread1ENTRY]don't care [466] L87-5-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 43636#[thread1ENTRY, L88]don't care [493] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] 43638#[L88-1, thread1ENTRY]don't care [521] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 43714#[thread1ENTRY, L88-2]don't care [412] L88-2-->L88-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre15#1_2|)) |v_#memory_int_6|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 43908#[thread1ENTRY, L88-3]don't care [580] L88-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre15#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_8|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_14|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_4|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_4|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_4|, thread2Thread1of1ForFork2_#t~ret6#1=|v_thread2Thread1of1ForFork2_#t~ret6#1_4|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~ret6#1, thread2Thread1of1ForFork2_plus_#in~a#1] 37194#[thread2ENTRY, L88-4, thread1ENTRY]don't care [552] thread2ENTRY-->L57-4: Formula: (= |v_thread2Thread1of1ForFork2_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1] 37196#[L88-4, thread1ENTRY, L57-4]don't care [2022-07-22 11:57:13,345 INFO L750 eck$LassoCheckResult]: Loop: 37196#[L88-4, thread1ENTRY, L57-4]don't care [555] L57-4-->L58: Formula: (< |v_thread2Thread1of1ForFork2_~i~1#1_5| v_~M~0_1) InVars {~M~0=v_~M~0_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_5|} OutVars{~M~0=v_~M~0_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_5|} AuxVars[] AssignedVars[] 44170#[L58, L88-4, thread1ENTRY]don't care [557] L58-->L60: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork2_~i~1#1_7| 4))) (let ((.cse0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|)) (.cse2 (+ v_~A~0.offset_32 .cse1))) (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_1| |v_thread2Thread1of1ForFork2_plus_~a#1_1|) (<= (+ v_~A~0.offset_32 4 .cse1) (select |v_#length_47| v_~A~0.base_32)) (= (select |v_#valid_54| v_~A~0.base_32) 1) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse0) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| v_~res2~0_45) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_1| v_~res2~0_46) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_43| v_~A~0.base_32) .cse2)) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork2_plus_~b#1_1|)) 1 0) 0)) (<= 0 .cse2)))) InVars {~A~0.base=v_~A~0.base_32, ~A~0.offset=v_~A~0.offset_32, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_43|, #length=|v_#length_47|, ~res2~0=v_~res2~0_46} OutVars{~A~0.base=v_~A~0.base_32, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, ~A~0.offset=v_~A~0.offset_32, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #valid=|v_#valid_54|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_1|, #memory_int=|v_#memory_int_43|, thread2Thread1of1ForFork2_#t~ret6#1=|v_thread2Thread1of1ForFork2_#t~ret6#1_1|, #length=|v_#length_47|, ~res2~0=v_~res2~0_45, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~ret6#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, ~res2~0, thread2Thread1of1ForFork2_plus_#in~a#1] 44102#[L60, L88-4, thread1ENTRY]don't care [559] L60-->L57-2: Formula: (= |v_thread2Thread1of1ForFork2_~i~1#1_9| |v_thread2Thread1of1ForFork2_#t~post4#1_1|) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1] 44106#[L88-4, thread1ENTRY, L57-2]don't care [560] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork2_~i~1#1_11| (+ |v_thread2Thread1of1ForFork2_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_11|, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1] 44282#[L88-4, L57-3, thread1ENTRY]don't care [561] L57-3-->L57-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1] 37196#[L88-4, thread1ENTRY, L57-4]don't care [2022-07-22 11:57:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash -507612123, now seen corresponding path program 1 times [2022-07-22 11:57:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:13,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337720499] [2022-07-22 11:57:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:13,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:13,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash 558332013, now seen corresponding path program 1 times [2022-07-22 11:57:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:13,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710908402] [2022-07-22 11:57:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:13,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:13,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -706741559, now seen corresponding path program 1 times [2022-07-22 11:57:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:13,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670944220] [2022-07-22 11:57:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:13,660 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 11:57:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:57:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670944220] [2022-07-22 11:57:13,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670944220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:57:13,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:57:13,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 11:57:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824357366] [2022-07-22 11:57:13,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:57:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:57:13,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 11:57:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:57:13,815 INFO L87 Difference]: Start difference. First operand 4360 states and 15372 transitions. cyclomatic complexity: 11431 Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 11:57:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:57:14,336 INFO L93 Difference]: Finished difference Result 4508 states and 15295 transitions. [2022-07-22 11:57:14,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4508 states and 15295 transitions. [2022-07-22 11:57:14,389 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 3290 [2022-07-22 11:57:14,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4508 states to 3653 states and 12852 transitions. [2022-07-22 11:57:14,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3643 [2022-07-22 11:57:14,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3643 [2022-07-22 11:57:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3653 states and 12852 transitions. [2022-07-22 11:57:14,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:57:14,462 INFO L220 hiAutomatonCegarLoop]: Abstraction has 3653 states and 12852 transitions. [2022-07-22 11:57:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states and 12852 transitions. [2022-07-22 11:57:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3649. [2022-07-22 11:57:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3649 states, 3649 states have (on average 3.5209646478487255) internal successors, (12848), 3648 states have internal predecessors, (12848), 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 11:57:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 12848 transitions. [2022-07-22 11:57:14,602 INFO L242 hiAutomatonCegarLoop]: Abstraction has 3649 states and 12848 transitions. [2022-07-22 11:57:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 11:57:14,604 INFO L425 stractBuchiCegarLoop]: Abstraction has 3649 states and 12848 transitions. [2022-07-22 11:57:14,604 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 11:57:14,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3649 states and 12848 transitions. [2022-07-22 11:57:14,676 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 3290 [2022-07-22 11:57:14,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:14,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:14,677 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] [2022-07-22 11:57:14,678 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:14,679 INFO L748 eck$LassoCheckResult]: Stem: 56875#[ULTIMATE.startENTRY]don't care [527] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56877#[L-1]don't care [440] 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] 52957#[L-1-1]don't care [534] L-1-1-->L-1-2: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 52959#[L-1-2]don't care [535] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 56489#[L21]don't care [496] L21-->L21-1: Formula: (and (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 54127#[L21-1]don't care [522] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 51039#[L21-2]don't care [451] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 51041#[L21-3]don't care [486] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_11| 2) 33)) InVars {#length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 56131#[L21-4]don't care [465] L21-4-->L41: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 56133#[L41]don't care [429] L41-->L41-1: Formula: (= v_~res1~0_4 0) InVars {} OutVars{~res1~0=v_~res1~0_4} AuxVars[] AssignedVars[~res1~0] 53863#[L41-1]don't care [441] L41-1-->L41-2: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 53865#[L41-2]don't care [453] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 56995#[L41-3]don't care [520] L41-3-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 54149#[L-1-3]don't care [538] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54151#[L-1-4]don't care [446] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56667#[L-1-5]don't care [415] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 56795#[L-1-6]don't care [515] L-1-6-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 55561#[L77]don't care [476] L77-->L77-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_13|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 55563#[L77-1]don't care [488] L77-1-->L77-2: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_21|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 55793#[L77-2]don't care [444] L77-2-->L77-3: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (= (store |v_#length_17| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_16|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_17|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 56921#[L77-3]don't care [481] L77-3-->L80: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~M~0] 50815#[L80]don't care [405] L80-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 50817#[L81]don't care [531] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 54175#[L81-1]don't care [399] L81-1-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 54177#[L82]don't care [490] L82-->L82-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56999#[L82-1]don't care [406] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 56975#[L82-2]don't care [536] L82-2-->L82-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] 56977#[L82-3]don't care [410] L82-3-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 56759#[L100]don't care [456] L100-->L101: 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] 56761#[L101]don't care [528] L101-->L101-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56917#[L101-1]don't care [420] L101-1-->L101-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] 56471#[L101-2]don't care [484] L101-2-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 56199#[L36]don't care [532] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) 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_7|, 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] 56201#[L37]don't care [458] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 56685#[L36-1]don't care [519] L36-1-->L102: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51913#[L102]don't care [447] L102-->L102-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51915#[L102-1]don't care [421] L102-1-->L102-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] 56893#[L102-2]don't care [445] L102-2-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 55641#[L36-2]don't care [509] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 55643#[L37-3]don't care [435] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[] 56307#[L36-3]don't care [474] L36-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56309#[L104]don't care [419] L104-->L104-1: Formula: (and (= (store |v_#length_19| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_18|) (= (select |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_5|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_25|, #length=|v_#length_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 56409#[L104-1]don't care [539] L104-1-->L104-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 56803#[L104-2]don't care [541] L104-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 56881#[L105]don't care [418] L105-->L105-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 57007#[L105-6]don't care [403] L105-6-->L106: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 57009#[L106]don't care [524] L106-->L106-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (select |v_#valid_27| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} AuxVars[] AssignedVars[#memory_int] 56979#[L106-1]don't care [516] L106-1-->L105-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet24#1] 56939#[L105-3]don't care [537] L105-3-->L105-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 56941#[L105-4]don't care [454] L105-4-->L105-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1] 56779#[L105-5]don't care [491] L105-5-->L105-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 56781#[L105-6]don't care [402] L105-6-->L105-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 57001#[L105-7]don't care [523] L105-7-->L108: 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] 55117#[L108]don't care [422] L108-->L82-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) 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_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 55119#[L82-4]don't care [492] L82-4-->L82-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56743#[L82-5]don't care [438] L82-5-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_5) (= v_~A~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 54899#[L82-6]don't care [482] L82-6-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 54901#[L84]don't care [525] L84-->L84-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 55849#[L84-1]don't care [533] L84-1-->L84-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (<= v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ~M~0=v_~M~0_6, 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] 55851#[L84-2]don't care [430] L84-2-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 56887#[L36-4]don't care [428] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) 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_15|, 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] 56985#[L37-6]don't care [470] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 57005#[L36-5]don't care [449] L36-5-->L87: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56819#[L87]don't care [455] L87-->L87-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 56821#[L87-1]don't care [404] L87-1-->L87-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 49727#[L87-2]don't care [398] L87-2-->L87-3: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= |v_#memory_int_4| (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre13#1_2|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_5|, #length=|v_#length_4|, 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|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, #length=|v_#length_4|, 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|} AuxVars[] AssignedVars[#memory_int] 49729#[L87-3]don't care [577] L87-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 50877#[L87-4, thread1ENTRY]don't care [542] thread1ENTRY-->L47-4: 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] 54075#[L47-4, L87-4]don't care [2022-07-22 11:57:14,680 INFO L750 eck$LassoCheckResult]: Loop: 54075#[L47-4, L87-4]don't care [545] L47-4-->L48: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 54079#[L87-4, L48]don't care [547] L48-->L50: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4))) (let ((.cse1 (+ .cse2 v_~A~0.offset_36)) (.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|))) (and (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= (select |v_#valid_58| v_~A~0.base_36) 1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| v_~res1~0_25) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~res1~0_26) (<= (+ .cse2 v_~A~0.offset_36 4) (select |v_#length_51| v_~A~0.base_36)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_47| v_~A~0.base_36) .cse1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| |v_thread1Thread1of1ForFork1_plus_~a#1_1|) (= .cse0 |v_thread1Thread1of1ForFork1_plus_#res#1_1|)))) InVars {~res1~0=v_~res1~0_26, ~A~0.base=v_~A~0.base_36, ~A~0.offset=v_~A~0.offset_36, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_47|, #length=|v_#length_51|} OutVars{~res1~0=v_~res1~0_25, ~A~0.base=v_~A~0.base_36, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.offset=v_~A~0.offset_36, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_47|, #length=|v_#length_51|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 55071#[L87-4, L50]don't care [549] L50-->L47-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 54135#[L87-4, L47-2]don't care [550] L47-2-->L47-3: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 54139#[L47-3, L87-4]don't care [551] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 54075#[L47-4, L87-4]don't care [2022-07-22 11:57:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash -604755158, now seen corresponding path program 1 times [2022-07-22 11:57:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:14,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465139059] [2022-07-22 11:57:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:14,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:14,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 548788963, now seen corresponding path program 2 times [2022-07-22 11:57:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353470803] [2022-07-22 11:57:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:14,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:14,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1134248282, now seen corresponding path program 1 times [2022-07-22 11:57:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:14,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230647867] [2022-07-22 11:57:14,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:14,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:14,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:16,933 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:16,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:16,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:16,934 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:16,934 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:16,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:16,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:16,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:16,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-array-sum-alt2.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 11:57:16,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:16,935 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:16,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:16,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 11:57:16,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:17,248 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 11:57:17,252 INFO L158 Benchmark]: Toolchain (without parser) took 15299.42ms. Allocated memory was 154.1MB in the beginning and 829.4MB in the end (delta: 675.3MB). Free memory was 128.9MB in the beginning and 632.8MB in the end (delta: -504.0MB). Peak memory consumption was 257.3MB. Max. memory is 8.0GB. [2022-07-22 11:57:17,252 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 154.1MB. Free memory was 124.0MB in the beginning and 123.9MB in the end (delta: 66.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 11:57:17,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.36ms. Allocated memory is still 154.1MB. Free memory was 128.6MB in the beginning and 117.4MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 11:57:17,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.73ms. Allocated memory is still 154.1MB. Free memory was 117.3MB in the beginning and 115.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:57:17,254 INFO L158 Benchmark]: Boogie Preprocessor took 84.92ms. Allocated memory is still 154.1MB. Free memory was 115.1MB in the beginning and 113.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:57:17,254 INFO L158 Benchmark]: RCFGBuilder took 907.62ms. Allocated memory is still 154.1MB. Free memory was 113.4MB in the beginning and 121.7MB in the end (delta: -8.3MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2022-07-22 11:57:17,255 INFO L158 Benchmark]: BuchiAutomizer took 13774.61ms. Allocated memory was 154.1MB in the beginning and 829.4MB in the end (delta: 675.3MB). Free memory was 121.2MB in the beginning and 632.8MB in the end (delta: -511.7MB). Peak memory consumption was 250.1MB. Max. memory is 8.0GB. [2022-07-22 11:57:17,258 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 154.1MB. Free memory was 124.0MB in the beginning and 123.9MB in the end (delta: 66.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.36ms. Allocated memory is still 154.1MB. Free memory was 128.6MB in the beginning and 117.4MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.73ms. Allocated memory is still 154.1MB. Free memory was 117.3MB in the beginning and 115.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.92ms. Allocated memory is still 154.1MB. Free memory was 115.1MB in the beginning and 113.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 907.62ms. Allocated memory is still 154.1MB. Free memory was 113.4MB in the beginning and 121.7MB in the end (delta: -8.3MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 13774.61ms. Allocated memory was 154.1MB in the beginning and 829.4MB in the end (delta: 675.3MB). Free memory was 121.2MB in the beginning and 632.8MB in the end (delta: -511.7MB). Peak memory consumption was 250.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 11:57:17,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...