/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:18:05,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:18:05,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:18:05,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:18:05,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:18:05,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:18:05,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:18:05,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:18:05,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:18:05,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:18:05,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:18:05,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:18:05,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:18:05,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:18:05,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:18:05,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:18:05,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:18:05,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:18:05,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:18:05,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:18:05,419 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:18:05,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:18:05,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:18:05,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:18:05,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:18:05,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:18:05,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:18:05,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:18:05,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:18:05,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:18:05,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:18:05,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:18:05,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:18:05,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:18:05,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:18:05,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:18:05,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:18:05,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:18:05,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:18:05,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:18:05,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:18:05,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:18:05,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:18:05,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:18:05,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:18:05,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:18:05,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:18:05,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:18:05,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:18:05,517 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:18:05,517 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:18:05,518 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:18:05,519 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:18:05,519 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:18:05,519 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:18:05,519 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:18:05,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:18:05,520 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:18:05,520 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:18:05,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:18:05,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:18:05,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:18:05,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:18:05,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:18:05,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:18:05,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:18:05,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:18:05,522 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:18:05,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:18:05,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:18:05,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:18:05,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:18:05,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:18:05,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:18:05,526 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:18:05,527 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:18:05,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:18:06,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:18:06,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:18:06,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:18:06,010 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:18:06,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-07-22 12:18:06,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0791ccd/c7fa5e4751f149668919fac60659a848/FLAGc1c6e6dbd [2022-07-22 12:18:06,838 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:18:06,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-07-22 12:18:06,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0791ccd/c7fa5e4751f149668919fac60659a848/FLAGc1c6e6dbd [2022-07-22 12:18:07,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0791ccd/c7fa5e4751f149668919fac60659a848 [2022-07-22 12:18:07,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:18:07,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:18:07,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:18:07,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:18:07,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:18:07,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6a9882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07, skipping insertion in model container [2022-07-22 12:18:07,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:18:07,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:18:07,431 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/chl-word-subst.wvr.c[3345,3358] [2022-07-22 12:18:07,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:18:07,448 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:18:07,485 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/chl-word-subst.wvr.c[3345,3358] [2022-07-22 12:18:07,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:18:07,509 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:18:07,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07 WrapperNode [2022-07-22 12:18:07,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:18:07,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:18:07,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:18:07,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:18:07,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,588 INFO L137 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 167 [2022-07-22 12:18:07,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:18:07,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:18:07,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:18:07,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:18:07,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:18:07,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:18:07,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:18:07,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:18:07,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (1/1) ... [2022-07-22 12:18:07,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:07,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:07,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:07,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:18:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:18:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:18:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:18:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:18:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:18:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:18:07,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:18:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:18:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:18:07,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:18:07,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:18:07,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:18:07,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:18:07,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:18:07,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:18:07,827 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:18:07,991 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:18:07,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:18:08,622 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:18:08,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:18:08,639 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 12:18:08,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:18:08 BoogieIcfgContainer [2022-07-22 12:18:08,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:18:08,644 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:18:08,644 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:18:08,648 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:18:08,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:18:08,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:18:07" (1/3) ... [2022-07-22 12:18:08,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77e9cb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:18:08, skipping insertion in model container [2022-07-22 12:18:08,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:18:08,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:18:07" (2/3) ... [2022-07-22 12:18:08,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77e9cb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:18:08, skipping insertion in model container [2022-07-22 12:18:08,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:18:08,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:18:08" (3/3) ... [2022-07-22 12:18:08,653 INFO L322 chiAutomizerObserver]: Analyzing ICFG chl-word-subst.wvr.c [2022-07-22 12:18:08,866 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:18:08,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 305 places, 333 transitions, 690 flow [2022-07-22 12:18:09,129 INFO L129 PetriNetUnfolder]: 35/327 cut-off events. [2022-07-22 12:18:09,130 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:18:09,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 327 events. 35/327 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 498 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 252. Up to 3 conditions per place. [2022-07-22 12:18:09,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 333 transitions, 690 flow [2022-07-22 12:18:09,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 327 transitions, 672 flow [2022-07-22 12:18:09,162 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:18:09,178 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 327 transitions, 672 flow [2022-07-22 12:18:09,181 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 327 transitions, 672 flow [2022-07-22 12:18:09,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 302 places, 327 transitions, 672 flow [2022-07-22 12:18:09,257 INFO L129 PetriNetUnfolder]: 35/327 cut-off events. [2022-07-22 12:18:09,258 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:18:09,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 327 events. 35/327 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 516 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 252. Up to 3 conditions per place. [2022-07-22 12:18:09,273 INFO L116 LiptonReduction]: Number of co-enabled transitions 12480 [2022-07-22 12:18:21,207 INFO L131 LiptonReduction]: Checked pairs total: 15071 [2022-07-22 12:18:21,208 INFO L133 LiptonReduction]: Total number of compositions: 372 [2022-07-22 12:18:21,232 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:18:21,232 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:18:21,233 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:18:21,233 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:18:21,233 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:18:21,233 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:18:21,233 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:18:21,233 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:18:21,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:18:21,375 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 221 [2022-07-22 12:18:21,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:21,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:21,387 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:18:21,387 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:21,388 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:18:21,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 348 states, but on-demand construction may add more states [2022-07-22 12:18:21,412 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 221 [2022-07-22 12:18:21,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:21,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:21,413 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:18:21,413 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:21,419 INFO L748 eck$LassoCheckResult]: Stem: 308#[ULTIMATE.startENTRY]don't care [1299] ULTIMATE.startENTRY-->L139-6: Formula: (let ((.cse3 (store |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73| 1))) (let ((.cse1 (select |v_#memory_int_426| 1)) (.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143| 1))) (and (= v_~res3~0_72 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t2~0#1.base_73|) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_451| 1) 1) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143|)) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) (= (select |v_#valid_451| 0) 0) (= v_~get3~0.offset_115 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) (= v_~get2~0.offset_121 0) (= v_~res1~0_66 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse1 0) 48) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_133| 0) (= (select |v_#valid_451| 2) 1) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) 0) (= v_~get1~0.offset_69 0) (= v_~res2~0_72 0) (= v_~get2~0.base_121 0) (< 0 |v_#StackHeapBarrier_68|) (= |v_#valid_449| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 1)) (= (store (store (store (store |v_#length_396| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_73| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_143| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4)) |v_#length_394|) (= (select |v_#length_396| 2) 21) (= (select |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154| 0) (= v_~get3~0.base_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133| 0) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| |v_#StackHeapBarrier_68|) (= 2 (select |v_#length_396| 1)) (= v_~get1~0.base_69 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~n1~0_68))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_451|, #memory_int=|v_#memory_int_426|, #length=|v_#length_396|} OutVars{~res1~0=v_~res1~0_66, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~get3~0.base=v_~get3~0.base_115, ~n3~0=v_~n3~0_92, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_83|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_43|, ~get1~0.base=v_~get1~0.base_69, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_84|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_24|, ~get2~0.offset=v_~get2~0.offset_121, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_37|, #length=|v_#length_394|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~count1~0=v_~count1~0_65, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_186|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_36|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_22|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_51|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_78|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_35|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_37|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_113|, ~get1~0.offset=v_~get1~0.offset_69, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_43|, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_22|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_117|, ~n1~0=v_~n1~0_68, ~count2~0=v_~count2~0_63, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_133|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_41|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_40|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_113|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, ~get2~0.base=v_~get2~0.base_121, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_78|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ~get3~0.offset=v_~get3~0.offset_115, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_77|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_34|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_36|, ~res2~0=v_~res2~0_72, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_26|, ~n2~0=v_~n2~0_88, ~count3~0=v_~count3~0_65, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_19|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_449|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_35|, #memory_int=|v_#memory_int_426|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_37|, ~res3~0=v_~res3~0_72} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~get3~0.base, ~n3~0, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #NULL.offset, ULTIMATE.start_main_#t~ret29#1.offset, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_main_#t~nondet22#1, ~get2~0.offset, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~count1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~mem37#1, ULTIMATE.start_main_#t~pre35#1, ~n1~0, ~count2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_main_~#t3~0#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~get3~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre33#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~nondet26#1, ~res2~0, ULTIMATE.start_main_#t~nondet23#1, ~n2~0, ~count3~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, #valid, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset, ~res3~0] 311#[L139-6]don't care [2022-07-22 12:18:21,420 INFO L750 eck$LassoCheckResult]: Loop: 311#[L139-6]don't care [1176] L139-6-->L139-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_80|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65| 4) (select |v_#length_194| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|)) (= (select |v_#valid_225| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|) 1) (= (store |v_#memory_int_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65| (store (select |v_#memory_int_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_45|)) |v_#memory_int_218|) (<= 0 .cse1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_98|)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_219|, #length=|v_#length_194|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_98|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_45|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_218|, #length=|v_#length_194|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_80|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_98|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 311#[L139-6]don't care [2022-07-22 12:18:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1330, now seen corresponding path program 1 times [2022-07-22 12:18:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950410877] [2022-07-22 12:18:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1207, now seen corresponding path program 1 times [2022-07-22 12:18:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:21,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061407136] [2022-07-22 12:18:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 42406, now seen corresponding path program 1 times [2022-07-22 12:18:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:21,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126607145] [2022-07-22 12:18:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:21,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:22,979 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:22,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:22,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:22,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:22,981 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:22,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:22,981 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:22,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:22,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-word-subst.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:18:22,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:22,982 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:23,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:23,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:24,035 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:24,041 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:24,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:24,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:24,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:24,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:18:24,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:24,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:24,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:24,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:24,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:18:24,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:24,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:18:24,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:24,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:24,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:24,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:18:24,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:24,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:24,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:24,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:24,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:24,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:24,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:18:24,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:24,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:18:24,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:24,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:24,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:24,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:24,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:24,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:24,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:24,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:24,477 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:18:24,477 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:18:24,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:24,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:24,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:24,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:18:24,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:24,514 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:18:24,514 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:24,515 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 12:18:24,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:24,703 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:18:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:24,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:24,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:18:24,828 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:18:24,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 348 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:24,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 348 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 351 states and 1424 transitions. Complement of second has 3 states. [2022-07-22 12:18:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:18:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:18:24,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:18:24,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:18:24,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:18:24,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:24,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 351 states and 1424 transitions. [2022-07-22 12:18:24,928 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 220 [2022-07-22 12:18:24,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 351 states to 323 states and 1283 transitions. [2022-07-22 12:18:24,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2022-07-22 12:18:24,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2022-07-22 12:18:24,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 323 states and 1283 transitions. [2022-07-22 12:18:24,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:18:24,957 INFO L220 hiAutomatonCegarLoop]: Abstraction has 323 states and 1283 transitions. [2022-07-22 12:18:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states and 1283 transitions. [2022-07-22 12:18:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2022-07-22 12:18:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 322 states have (on average 3.9782608695652173) internal successors, (1281), 321 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1281 transitions. [2022-07-22 12:18:25,056 INFO L242 hiAutomatonCegarLoop]: Abstraction has 322 states and 1281 transitions. [2022-07-22 12:18:25,056 INFO L425 stractBuchiCegarLoop]: Abstraction has 322 states and 1281 transitions. [2022-07-22 12:18:25,057 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:18:25,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states and 1281 transitions. [2022-07-22 12:18:25,061 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 220 [2022-07-22 12:18:25,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:25,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:25,062 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:18:25,062 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:25,063 INFO L748 eck$LassoCheckResult]: Stem: 2102#[ULTIMATE.startENTRY]don't care [1299] ULTIMATE.startENTRY-->L139-6: Formula: (let ((.cse3 (store |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73| 1))) (let ((.cse1 (select |v_#memory_int_426| 1)) (.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143| 1))) (and (= v_~res3~0_72 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t2~0#1.base_73|) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_451| 1) 1) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143|)) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) (= (select |v_#valid_451| 0) 0) (= v_~get3~0.offset_115 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) (= v_~get2~0.offset_121 0) (= v_~res1~0_66 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse1 0) 48) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_133| 0) (= (select |v_#valid_451| 2) 1) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) 0) (= v_~get1~0.offset_69 0) (= v_~res2~0_72 0) (= v_~get2~0.base_121 0) (< 0 |v_#StackHeapBarrier_68|) (= |v_#valid_449| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 1)) (= (store (store (store (store |v_#length_396| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_73| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_143| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4)) |v_#length_394|) (= (select |v_#length_396| 2) 21) (= (select |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154| 0) (= v_~get3~0.base_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133| 0) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| |v_#StackHeapBarrier_68|) (= 2 (select |v_#length_396| 1)) (= v_~get1~0.base_69 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~n1~0_68))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_451|, #memory_int=|v_#memory_int_426|, #length=|v_#length_396|} OutVars{~res1~0=v_~res1~0_66, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~get3~0.base=v_~get3~0.base_115, ~n3~0=v_~n3~0_92, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_83|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_43|, ~get1~0.base=v_~get1~0.base_69, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_84|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_24|, ~get2~0.offset=v_~get2~0.offset_121, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_37|, #length=|v_#length_394|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~count1~0=v_~count1~0_65, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_186|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_36|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_22|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_51|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_78|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_35|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_37|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_113|, ~get1~0.offset=v_~get1~0.offset_69, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_43|, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_22|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_117|, ~n1~0=v_~n1~0_68, ~count2~0=v_~count2~0_63, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_133|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_41|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_40|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_113|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, ~get2~0.base=v_~get2~0.base_121, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_78|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ~get3~0.offset=v_~get3~0.offset_115, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_77|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_34|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_36|, ~res2~0=v_~res2~0_72, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_26|, ~n2~0=v_~n2~0_88, ~count3~0=v_~count3~0_65, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_19|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_449|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_35|, #memory_int=|v_#memory_int_426|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_37|, ~res3~0=v_~res3~0_72} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~get3~0.base, ~n3~0, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #NULL.offset, ULTIMATE.start_main_#t~ret29#1.offset, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_main_#t~nondet22#1, ~get2~0.offset, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~count1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~mem37#1, ULTIMATE.start_main_#t~pre35#1, ~n1~0, ~count2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_main_~#t3~0#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~get3~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre33#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~nondet26#1, ~res2~0, ULTIMATE.start_main_#t~nondet23#1, ~n2~0, ~count3~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, #valid, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset, ~res3~0] 2000#[L139-6]don't care [1305] L139-6-->L139-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~get1~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~n2~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (= v_~get1~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_18|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|) 1 0) 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|, ~get1~0.base=v_~get1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_Out_2|, #length=|v_#length_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_18|, ~get1~0.offset=v_~get1~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset] 2004#[L139-14]don't care [2022-07-22 12:18:25,063 INFO L750 eck$LassoCheckResult]: Loop: 2004#[L139-14]don't care [1213] L139-14-->L139-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_114|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (= (store |v_#memory_int_297| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_297| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_53|)) |v_#memory_int_296|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, #valid=|v_#valid_291|, #memory_int=|v_#memory_int_297|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_114|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_51|, #valid=|v_#valid_291|, #memory_int=|v_#memory_int_296|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_114|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 2004#[L139-14]don't care [2022-07-22 12:18:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 42535, now seen corresponding path program 1 times [2022-07-22 12:18:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136671888] [2022-07-22 12:18:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1244, now seen corresponding path program 1 times [2022-07-22 12:18:25,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124220111] [2022-07-22 12:18:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1319798, now seen corresponding path program 1 times [2022-07-22 12:18:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:25,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992131875] [2022-07-22 12:18:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:25,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:26,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:26,899 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:26,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:26,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:26,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:26,899 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:26,899 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:26,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:26,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:26,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-word-subst.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:18:26,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:26,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:26,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:26,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:27,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:28,144 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:28,144 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:28,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:18:28,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,213 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:18:28,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:18:28,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:18:28,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,398 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,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 12:18:28,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:18:28,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:28,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:28,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:28,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:18:28,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,538 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:18:28,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,615 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:18:28,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,667 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:18:28,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 12:18:28,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,714 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:18:28,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,798 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:18:28,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,849 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:18:28,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,890 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:18:28,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:28,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:28,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:28,961 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:28,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:28,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:28,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:28,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:28,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:28,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:18:28,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:28,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:28,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:29,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,005 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:29,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:18:29,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:29,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:29,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:29,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:29,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:29,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:29,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:29,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:29,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:29,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,043 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:29,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:18:29,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:29,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:29,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:29,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:29,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:29,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:29,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:29,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:29,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:18:29,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,081 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:29,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:18:29,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:29,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:29,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:29,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:29,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:29,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:29,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:29,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:29,154 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-22 12:18:29,155 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 12:18:29,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:29,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:29,156 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:29,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:18:29,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:29,221 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:18:29,222 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:29,222 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 12:18:29,243 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 12:18:29,365 INFO L257 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2022-07-22 12:18:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:29,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:29,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:29,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:29,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:18:29,429 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:18:29,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 322 states and 1281 transitions. cyclomatic complexity: 1084 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:29,458 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 322 states and 1281 transitions. cyclomatic complexity: 1084. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 324 states and 1285 transitions. Complement of second has 3 states. [2022-07-22 12:18:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:18:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:18:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:18:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:18:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:18:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:29,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 1285 transitions. [2022-07-22 12:18:29,467 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 219 [2022-07-22 12:18:29,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 324 states and 1285 transitions. [2022-07-22 12:18:29,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2022-07-22 12:18:29,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2022-07-22 12:18:29,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 1285 transitions. [2022-07-22 12:18:29,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:18:29,479 INFO L220 hiAutomatonCegarLoop]: Abstraction has 324 states and 1285 transitions. [2022-07-22 12:18:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 1285 transitions. [2022-07-22 12:18:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2022-07-22 12:18:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 323 states have (on average 3.972136222910217) internal successors, (1283), 322 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1283 transitions. [2022-07-22 12:18:29,499 INFO L242 hiAutomatonCegarLoop]: Abstraction has 323 states and 1283 transitions. [2022-07-22 12:18:29,499 INFO L425 stractBuchiCegarLoop]: Abstraction has 323 states and 1283 transitions. [2022-07-22 12:18:29,499 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:18:29,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 1283 transitions. [2022-07-22 12:18:29,504 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 219 [2022-07-22 12:18:29,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:29,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:29,505 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:18:29,505 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:18:29,506 INFO L748 eck$LassoCheckResult]: Stem: 3205#[ULTIMATE.startENTRY]don't care [1299] ULTIMATE.startENTRY-->L139-6: Formula: (let ((.cse3 (store |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73| 1))) (let ((.cse1 (select |v_#memory_int_426| 1)) (.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143| 1))) (and (= v_~res3~0_72 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t2~0#1.base_73|) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_451| 1) 1) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143|)) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) (= (select |v_#valid_451| 0) 0) (= v_~get3~0.offset_115 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) (= v_~get2~0.offset_121 0) (= v_~res1~0_66 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse1 0) 48) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_133| 0) (= (select |v_#valid_451| 2) 1) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) 0) (= v_~get1~0.offset_69 0) (= v_~res2~0_72 0) (= v_~get2~0.base_121 0) (< 0 |v_#StackHeapBarrier_68|) (= |v_#valid_449| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 1)) (= (store (store (store (store |v_#length_396| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_73| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_143| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4)) |v_#length_394|) (= (select |v_#length_396| 2) 21) (= (select |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154| 0) (= v_~get3~0.base_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133| 0) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| |v_#StackHeapBarrier_68|) (= 2 (select |v_#length_396| 1)) (= v_~get1~0.base_69 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~n1~0_68))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_451|, #memory_int=|v_#memory_int_426|, #length=|v_#length_396|} OutVars{~res1~0=v_~res1~0_66, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~get3~0.base=v_~get3~0.base_115, ~n3~0=v_~n3~0_92, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_83|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_43|, ~get1~0.base=v_~get1~0.base_69, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_84|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_24|, ~get2~0.offset=v_~get2~0.offset_121, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_37|, #length=|v_#length_394|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~count1~0=v_~count1~0_65, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_186|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_36|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_22|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_51|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_78|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_35|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_37|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_113|, ~get1~0.offset=v_~get1~0.offset_69, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_43|, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_22|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_117|, ~n1~0=v_~n1~0_68, ~count2~0=v_~count2~0_63, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_133|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_41|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_40|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_113|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, ~get2~0.base=v_~get2~0.base_121, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_78|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ~get3~0.offset=v_~get3~0.offset_115, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_77|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_34|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_36|, ~res2~0=v_~res2~0_72, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_26|, ~n2~0=v_~n2~0_88, ~count3~0=v_~count3~0_65, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_19|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_449|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_35|, #memory_int=|v_#memory_int_426|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_37|, ~res3~0=v_~res3~0_72} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~get3~0.base, ~n3~0, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #NULL.offset, ULTIMATE.start_main_#t~ret29#1.offset, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_main_#t~nondet22#1, ~get2~0.offset, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~count1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~mem37#1, ULTIMATE.start_main_#t~pre35#1, ~n1~0, ~count2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_main_~#t3~0#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~get3~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre33#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~nondet26#1, ~res2~0, ULTIMATE.start_main_#t~nondet23#1, ~n2~0, ~count3~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, #valid, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset, ~res3~0] 3101#[L139-6]don't care [1305] L139-6-->L139-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~get1~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~n2~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (= v_~get1~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_18|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|) 1 0) 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|, ~get1~0.base=v_~get1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_Out_2|, #length=|v_#length_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_18|, ~get1~0.offset=v_~get1~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset] 3105#[L139-14]don't care [1303] L139-14-->L139-22: Formula: (and (= 0 (select |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~get2~0.offset_Out_2) (= |v_#length_Out_10| (store |v_#length_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= (store |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_10|) (= v_~get2~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|)) (= v_~n3~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ~n3~0=v_~n3~0_In_13, #valid=|v_#valid_In_13|, #length=|v_#length_In_13|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n3~0=v_~n3~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_14|, ~get2~0.base=v_~get2~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_Out_10|, ~get2~0.offset=v_~get2~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_14|, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~get2~0.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2743#[L139-22]don't care [2022-07-22 12:18:29,506 INFO L750 eck$LassoCheckResult]: Loop: 2743#[L139-22]don't care [1225] L139-22-->L139-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (<= 0 .cse0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_98| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_274| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (store |v_#memory_int_311| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_311| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_57|)) |v_#memory_int_310|) (= (select |v_#valid_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_313|, #memory_int=|v_#memory_int_311|, #length=|v_#length_274|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_55|, #valid=|v_#valid_313|, #memory_int=|v_#memory_int_310|, #length=|v_#length_274|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_98|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 2743#[L139-22]don't care [2022-07-22 12:18:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1319888, now seen corresponding path program 1 times [2022-07-22 12:18:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:29,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007863481] [2022-07-22 12:18:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1256, now seen corresponding path program 1 times [2022-07-22 12:18:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:29,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836795538] [2022-07-22 12:18:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 40917753, now seen corresponding path program 1 times [2022-07-22 12:18:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870992870] [2022-07-22 12:18:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:29,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:31,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:32,769 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:32,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:32,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:32,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:32,770 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:32,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:32,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:32,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:32,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-word-subst.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:18:32,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:32,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:32,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,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 12:18:33,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 12:18:33,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,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 12:18:33,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,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 12:18:33,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 12:18:33,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,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 12:18:33,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 12:18:33,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 12:18:33,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 12:18:33,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 12:18:33,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 12:18:33,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,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 12:18:33,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:33,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:34,445 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:18:34,445 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:18:34,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,448 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:18:34,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,457 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-07-22 12:18:34,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,470 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-07-22 12:18:34,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,541 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:18:34,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:18:34,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,582 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:18:34,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,652 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:18:34,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:34,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,698 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:18:34,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:18:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,758 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:18:34,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:18:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,806 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:18:34,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:34,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:34,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:34,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,840 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 12:18:34,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,844 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:18:34,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,883 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:18:34,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:34,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:34,950 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:34,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:34,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:34,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:34,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:34,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:34,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:34,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:34,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:18:34,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:35,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,009 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:18:35,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:18:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,047 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:18:35,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 12:18:35,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,088 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:18:35,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:18:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,130 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:18:35,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 12:18:35,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,171 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:18:35,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:35,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,213 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:18:35,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:18:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,255 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:18:35,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:18:35,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:18:35,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:18:35,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:35,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,291 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:18:35,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:18:35,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,332 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:18:35,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 12:18:35,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,372 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:18:35,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:18:35,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:35,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,448 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:18:35,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:18:35,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:18:35,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:18:35,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:18:35,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:18:35,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:18:35,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:18:35,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:18:35,518 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-22 12:18:35,518 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 12:18:35,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:35,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:18:35,520 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:18:35,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:18:35,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:18:35,530 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:18:35,531 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:18:35,531 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_3, ULTIMATE.start_create_fresh_int_array_~i~3#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_3 - 4*ULTIMATE.start_create_fresh_int_array_~i~3#1 Supporting invariants [] [2022-07-22 12:18:35,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:18:35,722 INFO L257 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2022-07-22 12:18:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:35,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:18:35,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:18:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:18:35,793 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:18:35,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 323 states and 1283 transitions. cyclomatic complexity: 1085 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:35,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 323 states and 1283 transitions. cyclomatic complexity: 1085. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 324 states and 1285 transitions. Complement of second has 3 states. [2022-07-22 12:18:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:18:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2022-07-22 12:18:35,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:18:35,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:18:35,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:18:35,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:18:35,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 1285 transitions. [2022-07-22 12:18:35,833 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 218 [2022-07-22 12:18:35,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 324 states and 1285 transitions. [2022-07-22 12:18:35,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2022-07-22 12:18:35,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2022-07-22 12:18:35,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 1285 transitions. [2022-07-22 12:18:35,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:18:35,842 INFO L220 hiAutomatonCegarLoop]: Abstraction has 324 states and 1285 transitions. [2022-07-22 12:18:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 1285 transitions. [2022-07-22 12:18:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-07-22 12:18:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 324 states have (on average 3.9660493827160495) internal successors, (1285), 323 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 1285 transitions. [2022-07-22 12:18:35,858 INFO L242 hiAutomatonCegarLoop]: Abstraction has 324 states and 1285 transitions. [2022-07-22 12:18:35,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 324 states and 1285 transitions. [2022-07-22 12:18:35,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:18:35,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 324 states and 1285 transitions. [2022-07-22 12:18:35,863 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 218 [2022-07-22 12:18:35,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:35,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:35,864 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:18:35,864 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:35,865 INFO L748 eck$LassoCheckResult]: Stem: 4345#[ULTIMATE.startENTRY]don't care [1299] ULTIMATE.startENTRY-->L139-6: Formula: (let ((.cse3 (store |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73| 1))) (let ((.cse1 (select |v_#memory_int_426| 1)) (.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143| 1))) (and (= v_~res3~0_72 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t2~0#1.base_73|) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_451| 1) 1) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143|)) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) (= (select |v_#valid_451| 0) 0) (= v_~get3~0.offset_115 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) (= v_~get2~0.offset_121 0) (= v_~res1~0_66 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse1 0) 48) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_133| 0) (= (select |v_#valid_451| 2) 1) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) 0) (= v_~get1~0.offset_69 0) (= v_~res2~0_72 0) (= v_~get2~0.base_121 0) (< 0 |v_#StackHeapBarrier_68|) (= |v_#valid_449| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 1)) (= (store (store (store (store |v_#length_396| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_73| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_143| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4)) |v_#length_394|) (= (select |v_#length_396| 2) 21) (= (select |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154| 0) (= v_~get3~0.base_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133| 0) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| |v_#StackHeapBarrier_68|) (= 2 (select |v_#length_396| 1)) (= v_~get1~0.base_69 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~n1~0_68))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_451|, #memory_int=|v_#memory_int_426|, #length=|v_#length_396|} OutVars{~res1~0=v_~res1~0_66, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~get3~0.base=v_~get3~0.base_115, ~n3~0=v_~n3~0_92, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_83|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_43|, ~get1~0.base=v_~get1~0.base_69, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_84|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_24|, ~get2~0.offset=v_~get2~0.offset_121, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_37|, #length=|v_#length_394|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~count1~0=v_~count1~0_65, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_186|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_36|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_22|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_51|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_78|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_35|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_37|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_113|, ~get1~0.offset=v_~get1~0.offset_69, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_43|, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_22|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_117|, ~n1~0=v_~n1~0_68, ~count2~0=v_~count2~0_63, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_133|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_41|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_40|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_113|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, ~get2~0.base=v_~get2~0.base_121, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_78|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ~get3~0.offset=v_~get3~0.offset_115, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_77|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_34|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_36|, ~res2~0=v_~res2~0_72, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_26|, ~n2~0=v_~n2~0_88, ~count3~0=v_~count3~0_65, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_19|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_449|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_35|, #memory_int=|v_#memory_int_426|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_37|, ~res3~0=v_~res3~0_72} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~get3~0.base, ~n3~0, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #NULL.offset, ULTIMATE.start_main_#t~ret29#1.offset, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_main_#t~nondet22#1, ~get2~0.offset, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~count1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~mem37#1, ULTIMATE.start_main_#t~pre35#1, ~n1~0, ~count2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_main_~#t3~0#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~get3~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre33#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~nondet26#1, ~res2~0, ULTIMATE.start_main_#t~nondet23#1, ~n2~0, ~count3~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, #valid, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset, ~res3~0] 4241#[L139-6]don't care [1305] L139-6-->L139-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~get1~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~n2~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (= v_~get1~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_18|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|) 1 0) 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|, ~get1~0.base=v_~get1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_Out_2|, #length=|v_#length_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_18|, ~get1~0.offset=v_~get1~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset] 4245#[L139-14]don't care [1303] L139-14-->L139-22: Formula: (and (= 0 (select |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~get2~0.offset_Out_2) (= |v_#length_Out_10| (store |v_#length_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= (store |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_10|) (= v_~get2~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|)) (= v_~n3~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ~n3~0=v_~n3~0_In_13, #valid=|v_#valid_In_13|, #length=|v_#length_In_13|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n3~0=v_~n3~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_14|, ~get2~0.base=v_~get2~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_Out_10|, ~get2~0.offset=v_~get2~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_14|, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~get2~0.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3881#[L139-22]don't care [1262] L139-22-->L120-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_322| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_148|)) (= v_~get3~0.offset_95 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_main_#t~pre31#1_39| |v_#pthreadsForks_201|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| v_~get3~0.base_95) (= (select |v_#valid_365| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|) (= (+ |v_#pthreadsForks_201| 1) |v_#pthreadsForks_200|) (= (store |v_#memory_int_369| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_369| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre31#1_39|)) |v_#memory_int_368|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, #pthreadsForks=|v_#pthreadsForks_201|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, #valid=|v_#valid_365|, #memory_int=|v_#memory_int_369|, #length=|v_#length_322|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_148|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~get3~0.base=v_~get3~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ~get3~0.offset=v_~get3~0.offset_95, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_148|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, #pthreadsForks=|v_#pthreadsForks_200|, #valid=|v_#valid_365|, #memory_int=|v_#memory_int_368|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_27|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_27|, #length=|v_#length_322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~get3~0.base, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~get3~0.offset] 3885#[L120-3]don't care [930] L120-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre31#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_20, thread1Thread1of1ForFork2_#t~ite6=|v_thread1Thread1of1ForFork2_#t~ite6_10|, thread1Thread1of1ForFork2_#t~ite7=|v_thread1Thread1of1ForFork2_#t~ite7_10|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_6|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_12|, thread1Thread1of1ForFork2_#t~mem3=|v_thread1Thread1of1ForFork2_#t~mem3_12|, thread1Thread1of1ForFork2_#t~mem4=|v_thread1Thread1of1ForFork2_#t~mem4_10|, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, thread1Thread1of1ForFork2_#t~mem5=|v_thread1Thread1of1ForFork2_#t~mem5_10|, thread1Thread1of1ForFork2_~stop~0=v_thread1Thread1of1ForFork2_~stop~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~ite6, thread1Thread1of1ForFork2_#t~ite7, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_#t~mem3, thread1Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork2_#t~post1, thread1Thread1of1ForFork2_#t~mem5, thread1Thread1of1ForFork2_~stop~0] 4215#[L120-4, thread1ENTRY]don't care [1097] thread1ENTRY-->L49-6: Formula: (and (= v_~count1~0_31 v_~count2~0_33) (= v_thread1Thread1of1ForFork2_~stop~0_23 0) (= v_thread1Thread1of1ForFork2_~i~0_41 0)) InVars {~count2~0=v_~count2~0_33, ~count1~0=v_~count1~0_31} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_41, ~count2~0=v_~count2~0_33, ~count1~0=v_~count1~0_31, thread1Thread1of1ForFork2_~stop~0=v_thread1Thread1of1ForFork2_~stop~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_~stop~0] 4047#[L49-6, L120-4]don't care [2022-07-22 12:18:35,865 INFO L750 eck$LassoCheckResult]: Loop: 4047#[L49-6, L120-4]don't care [1014] L49-6-->L50-1: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork2_~i~0_29 4))) (let ((.cse1 (+ .cse0 v_~get1~0.offset_17))) (and (<= (+ .cse0 v_~get1~0.offset_17 4) (select |v_#length_72| v_~get1~0.base_17)) (< v_thread1Thread1of1ForFork2_~i~0_29 v_~n2~0_16) (< v_thread1Thread1of1ForFork2_~i~0_29 v_~n1~0_14) (= (select (select |v_#memory_int_78| v_~get1~0.base_17) .cse1) |v_thread1Thread1of1ForFork2_#t~mem2_25|) (= (select |v_#valid_83| v_~get1~0.base_17) 1) (<= 0 .cse1)))) InVars {~n2~0=v_~n2~0_16, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_29, ~n1~0=v_~n1~0_14, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_78|, #length=|v_#length_72|, ~get1~0.offset=v_~get1~0.offset_17, ~get1~0.base=v_~get1~0.base_17} OutVars{~n2~0=v_~n2~0_16, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_25|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_29, ~n1~0=v_~n1~0_14, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_78|, #length=|v_#length_72|, ~get1~0.offset=v_~get1~0.offset_17, ~get1~0.base=v_~get1~0.base_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2] 4045#[L120-4, L50-1]don't care [1196] L50-1-->L49-6: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork2_~i~0_80 4))) (let ((.cse0 (+ v_~get2~0.offset_61 .cse1))) (and (= (select (select |v_#memory_int_268| v_~get2~0.base_61) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2_50|) (= (select |v_#valid_263| v_~get2~0.base_61) 1) (<= (+ v_~get2~0.offset_61 .cse1 4) (select |v_#length_232| v_~get2~0.base_61)) (= v_thread1Thread1of1ForFork2_~i~0_79 (+ v_thread1Thread1of1ForFork2_~i~0_80 1)) (<= 0 .cse0)))) InVars {thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_50|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_80, ~get2~0.offset=v_~get2~0.offset_61, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_268|, ~get2~0.base=v_~get2~0.base_61, #length=|v_#length_232|} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_79, thread1Thread1of1ForFork2_#t~mem3=|v_thread1Thread1of1ForFork2_#t~mem3_43|, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_61, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_268|, ~get2~0.base=v_~get2~0.base_61, #length=|v_#length_232|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~mem3, thread1Thread1of1ForFork2_#t~post1] 4047#[L49-6, L120-4]don't care [2022-07-22 12:18:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash 667320453, now seen corresponding path program 1 times [2022-07-22 12:18:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643881375] [2022-07-22 12:18:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 33591, now seen corresponding path program 1 times [2022-07-22 12:18:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:35,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850230725] [2022-07-22 12:18:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,954 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:35,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:35,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1344860859, now seen corresponding path program 1 times [2022-07-22 12:18:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:35,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914180204] [2022-07-22 12:18:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:18:36,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:18:36,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914180204] [2022-07-22 12:18:36,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914180204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:18:36,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:18:36,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:18:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099464603] [2022-07-22 12:18:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:18:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:18:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:18:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:18:36,155 INFO L87 Difference]: Start difference. First operand 324 states and 1285 transitions. cyclomatic complexity: 1086 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:18:36,454 INFO L93 Difference]: Finished difference Result 840 states and 3067 transitions. [2022-07-22 12:18:36,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 840 states and 3067 transitions. [2022-07-22 12:18:36,471 INFO L131 ngComponentsAnalysis]: Automaton has 314 accepting balls. 498 [2022-07-22 12:18:36,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 840 states to 816 states and 2955 transitions. [2022-07-22 12:18:36,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 812 [2022-07-22 12:18:36,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 812 [2022-07-22 12:18:36,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 816 states and 2955 transitions. [2022-07-22 12:18:36,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:18:36,491 INFO L220 hiAutomatonCegarLoop]: Abstraction has 816 states and 2955 transitions. [2022-07-22 12:18:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states and 2955 transitions. [2022-07-22 12:18:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 415. [2022-07-22 12:18:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 415 states have (on average 4.0) internal successors, (1660), 414 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1660 transitions. [2022-07-22 12:18:36,514 INFO L242 hiAutomatonCegarLoop]: Abstraction has 415 states and 1660 transitions. [2022-07-22 12:18:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:18:36,515 INFO L425 stractBuchiCegarLoop]: Abstraction has 415 states and 1660 transitions. [2022-07-22 12:18:36,515 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:18:36,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 415 states and 1660 transitions. [2022-07-22 12:18:36,521 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 266 [2022-07-22 12:18:36,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:36,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:36,522 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:18:36,522 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:36,523 INFO L748 eck$LassoCheckResult]: Stem: 5933#[ULTIMATE.startENTRY]don't care [1299] ULTIMATE.startENTRY-->L139-6: Formula: (let ((.cse3 (store |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73| 1))) (let ((.cse1 (select |v_#memory_int_426| 1)) (.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143| 1))) (and (= v_~res3~0_72 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t2~0#1.base_73|) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_451| 1) 1) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143|)) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) (= (select |v_#valid_451| 0) 0) (= v_~get3~0.offset_115 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) (= v_~get2~0.offset_121 0) (= v_~res1~0_66 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse1 0) 48) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_133| 0) (= (select |v_#valid_451| 2) 1) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) 0) (= v_~get1~0.offset_69 0) (= v_~res2~0_72 0) (= v_~get2~0.base_121 0) (< 0 |v_#StackHeapBarrier_68|) (= |v_#valid_449| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 1)) (= (store (store (store (store |v_#length_396| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_73| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_143| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4)) |v_#length_394|) (= (select |v_#length_396| 2) 21) (= (select |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154| 0) (= v_~get3~0.base_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133| 0) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| |v_#StackHeapBarrier_68|) (= 2 (select |v_#length_396| 1)) (= v_~get1~0.base_69 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~n1~0_68))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_451|, #memory_int=|v_#memory_int_426|, #length=|v_#length_396|} OutVars{~res1~0=v_~res1~0_66, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~get3~0.base=v_~get3~0.base_115, ~n3~0=v_~n3~0_92, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_83|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_43|, ~get1~0.base=v_~get1~0.base_69, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_84|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_24|, ~get2~0.offset=v_~get2~0.offset_121, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_37|, #length=|v_#length_394|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~count1~0=v_~count1~0_65, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_186|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_36|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_22|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_51|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_78|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_35|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_37|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_113|, ~get1~0.offset=v_~get1~0.offset_69, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_43|, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_22|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_117|, ~n1~0=v_~n1~0_68, ~count2~0=v_~count2~0_63, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_133|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_41|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_40|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_113|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, ~get2~0.base=v_~get2~0.base_121, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_78|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ~get3~0.offset=v_~get3~0.offset_115, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_77|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_34|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_36|, ~res2~0=v_~res2~0_72, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_26|, ~n2~0=v_~n2~0_88, ~count3~0=v_~count3~0_65, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_19|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_449|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_35|, #memory_int=|v_#memory_int_426|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_37|, ~res3~0=v_~res3~0_72} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~get3~0.base, ~n3~0, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #NULL.offset, ULTIMATE.start_main_#t~ret29#1.offset, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_main_#t~nondet22#1, ~get2~0.offset, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~count1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~mem37#1, ULTIMATE.start_main_#t~pre35#1, ~n1~0, ~count2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_main_~#t3~0#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~get3~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre33#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~nondet26#1, ~res2~0, ULTIMATE.start_main_#t~nondet23#1, ~n2~0, ~count3~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, #valid, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset, ~res3~0] 5763#[L139-6]don't care [1305] L139-6-->L139-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~get1~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~n2~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (= v_~get1~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_18|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|) 1 0) 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|, ~get1~0.base=v_~get1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_Out_2|, #length=|v_#length_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_18|, ~get1~0.offset=v_~get1~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset] 5767#[L139-14]don't care [1213] L139-14-->L139-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_114|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (= (store |v_#memory_int_297| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_297| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_53|)) |v_#memory_int_296|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, #valid=|v_#valid_291|, #memory_int=|v_#memory_int_297|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_114|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_51|, #valid=|v_#valid_291|, #memory_int=|v_#memory_int_296|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_114|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 5919#[L139-14]don't care [1303] L139-14-->L139-22: Formula: (and (= 0 (select |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~get2~0.offset_Out_2) (= |v_#length_Out_10| (store |v_#length_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= (store |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_10|) (= v_~get2~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|)) (= v_~n3~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ~n3~0=v_~n3~0_In_13, #valid=|v_#valid_In_13|, #length=|v_#length_In_13|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n3~0=v_~n3~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_14|, ~get2~0.base=v_~get2~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_Out_10|, ~get2~0.offset=v_~get2~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_14|, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~get2~0.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5921#[L139-22]don't care [1262] L139-22-->L120-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_322| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_148|)) (= v_~get3~0.offset_95 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_main_#t~pre31#1_39| |v_#pthreadsForks_201|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| v_~get3~0.base_95) (= (select |v_#valid_365| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|) (= (+ |v_#pthreadsForks_201| 1) |v_#pthreadsForks_200|) (= (store |v_#memory_int_369| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_369| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre31#1_39|)) |v_#memory_int_368|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, #pthreadsForks=|v_#pthreadsForks_201|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, #valid=|v_#valid_365|, #memory_int=|v_#memory_int_369|, #length=|v_#length_322|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_148|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~get3~0.base=v_~get3~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ~get3~0.offset=v_~get3~0.offset_95, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_148|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, #pthreadsForks=|v_#pthreadsForks_200|, #valid=|v_#valid_365|, #memory_int=|v_#memory_int_368|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_27|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_27|, #length=|v_#length_322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~get3~0.base, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~get3~0.offset] 6005#[L120-3]don't care [930] L120-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre31#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_20, thread1Thread1of1ForFork2_#t~ite6=|v_thread1Thread1of1ForFork2_#t~ite6_10|, thread1Thread1of1ForFork2_#t~ite7=|v_thread1Thread1of1ForFork2_#t~ite7_10|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_6|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_12|, thread1Thread1of1ForFork2_#t~mem3=|v_thread1Thread1of1ForFork2_#t~mem3_12|, thread1Thread1of1ForFork2_#t~mem4=|v_thread1Thread1of1ForFork2_#t~mem4_10|, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, thread1Thread1of1ForFork2_#t~mem5=|v_thread1Thread1of1ForFork2_#t~mem5_10|, thread1Thread1of1ForFork2_~stop~0=v_thread1Thread1of1ForFork2_~stop~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~ite6, thread1Thread1of1ForFork2_#t~ite7, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_#t~mem3, thread1Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork2_#t~post1, thread1Thread1of1ForFork2_#t~mem5, thread1Thread1of1ForFork2_~stop~0] 6003#[L120-4, thread1ENTRY]don't care [1097] thread1ENTRY-->L49-6: Formula: (and (= v_~count1~0_31 v_~count2~0_33) (= v_thread1Thread1of1ForFork2_~stop~0_23 0) (= v_thread1Thread1of1ForFork2_~i~0_41 0)) InVars {~count2~0=v_~count2~0_33, ~count1~0=v_~count1~0_31} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_41, ~count2~0=v_~count2~0_33, ~count1~0=v_~count1~0_31, thread1Thread1of1ForFork2_~stop~0=v_thread1Thread1of1ForFork2_~stop~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_~stop~0] 5541#[L49-6, L120-4]don't care [2022-07-22 12:18:36,523 INFO L750 eck$LassoCheckResult]: Loop: 5541#[L49-6, L120-4]don't care [1014] L49-6-->L50-1: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork2_~i~0_29 4))) (let ((.cse1 (+ .cse0 v_~get1~0.offset_17))) (and (<= (+ .cse0 v_~get1~0.offset_17 4) (select |v_#length_72| v_~get1~0.base_17)) (< v_thread1Thread1of1ForFork2_~i~0_29 v_~n2~0_16) (< v_thread1Thread1of1ForFork2_~i~0_29 v_~n1~0_14) (= (select (select |v_#memory_int_78| v_~get1~0.base_17) .cse1) |v_thread1Thread1of1ForFork2_#t~mem2_25|) (= (select |v_#valid_83| v_~get1~0.base_17) 1) (<= 0 .cse1)))) InVars {~n2~0=v_~n2~0_16, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_29, ~n1~0=v_~n1~0_14, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_78|, #length=|v_#length_72|, ~get1~0.offset=v_~get1~0.offset_17, ~get1~0.base=v_~get1~0.base_17} OutVars{~n2~0=v_~n2~0_16, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_25|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_29, ~n1~0=v_~n1~0_14, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_78|, #length=|v_#length_72|, ~get1~0.offset=v_~get1~0.offset_17, ~get1~0.base=v_~get1~0.base_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2] 5539#[L120-4, L50-1]don't care [1196] L50-1-->L49-6: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork2_~i~0_80 4))) (let ((.cse0 (+ v_~get2~0.offset_61 .cse1))) (and (= (select (select |v_#memory_int_268| v_~get2~0.base_61) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2_50|) (= (select |v_#valid_263| v_~get2~0.base_61) 1) (<= (+ v_~get2~0.offset_61 .cse1 4) (select |v_#length_232| v_~get2~0.base_61)) (= v_thread1Thread1of1ForFork2_~i~0_79 (+ v_thread1Thread1of1ForFork2_~i~0_80 1)) (<= 0 .cse0)))) InVars {thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_50|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_80, ~get2~0.offset=v_~get2~0.offset_61, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_268|, ~get2~0.base=v_~get2~0.base_61, #length=|v_#length_232|} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_79, thread1Thread1of1ForFork2_#t~mem3=|v_thread1Thread1of1ForFork2_#t~mem3_43|, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_61, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_268|, ~get2~0.base=v_~get2~0.base_61, #length=|v_#length_232|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~mem3, thread1Thread1of1ForFork2_#t~post1] 5541#[L49-6, L120-4]don't care [2022-07-22 12:18:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash -869482924, now seen corresponding path program 1 times [2022-07-22 12:18:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:36,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169069877] [2022-07-22 12:18:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 33591, now seen corresponding path program 2 times [2022-07-22 12:18:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:36,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168077090] [2022-07-22 12:18:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:36,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1945565386, now seen corresponding path program 1 times [2022-07-22 12:18:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:36,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293447476] [2022-07-22 12:18:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:18:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:18:36,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:18:36,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293447476] [2022-07-22 12:18:36,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293447476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:18:36,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:18:36,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:18:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123993152] [2022-07-22 12:18:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:18:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:18:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:18:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:18:36,753 INFO L87 Difference]: Start difference. First operand 415 states and 1660 transitions. cyclomatic complexity: 1403 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:36,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:18:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:18:36,993 INFO L93 Difference]: Finished difference Result 767 states and 2932 transitions. [2022-07-22 12:18:36,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 767 states and 2932 transitions. [2022-07-22 12:18:37,008 INFO L131 ngComponentsAnalysis]: Automaton has 282 accepting balls. 454 [2022-07-22 12:18:37,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 767 states to 755 states and 2876 transitions. [2022-07-22 12:18:37,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 748 [2022-07-22 12:18:37,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 748 [2022-07-22 12:18:37,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 755 states and 2876 transitions. [2022-07-22 12:18:37,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:18:37,029 INFO L220 hiAutomatonCegarLoop]: Abstraction has 755 states and 2876 transitions. [2022-07-22 12:18:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states and 2876 transitions. [2022-07-22 12:18:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 417. [2022-07-22 12:18:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 417 states have (on average 3.9904076738609113) internal successors, (1664), 416 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:18:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1664 transitions. [2022-07-22 12:18:37,051 INFO L242 hiAutomatonCegarLoop]: Abstraction has 417 states and 1664 transitions. [2022-07-22 12:18:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:18:37,052 INFO L425 stractBuchiCegarLoop]: Abstraction has 417 states and 1664 transitions. [2022-07-22 12:18:37,052 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:18:37,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 1664 transitions. [2022-07-22 12:18:37,057 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 266 [2022-07-22 12:18:37,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:18:37,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:18:37,058 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:18:37,058 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:18:37,060 INFO L748 eck$LassoCheckResult]: Stem: 7542#[ULTIMATE.startENTRY]don't care [1299] ULTIMATE.startENTRY-->L139-6: Formula: (let ((.cse3 (store |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73| 1))) (let ((.cse1 (select |v_#memory_int_426| 1)) (.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143| 1))) (and (= v_~res3~0_72 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_69| 0) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t2~0#1.base_73|) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_451| 1) 1) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_143|)) (< |v_#StackHeapBarrier_68| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) (= (select |v_#valid_451| 0) 0) (= v_~get3~0.offset_115 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_186|) (= v_~get2~0.offset_121 0) (= v_~res1~0_66 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_247| 0)) (= (select .cse1 0) 48) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_133| 0) (= (select |v_#valid_451| 2) 1) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) 0) (= v_~get1~0.offset_69 0) (= v_~res2~0_72 0) (= v_~get2~0.base_121 0) (< 0 |v_#StackHeapBarrier_68|) (= |v_#valid_449| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| 1)) (= (store (store (store (store |v_#length_396| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_73| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_143| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_186| 4)) |v_#length_394|) (= (select |v_#length_396| 2) 21) (= (select |v_#valid_451| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_73|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154| 0) (= v_~get3~0.base_115 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133| 0) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133| |v_#StackHeapBarrier_68|) (= 2 (select |v_#length_396| 1)) (= v_~get1~0.base_69 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~n1~0_68))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_68|, #valid=|v_#valid_451|, #memory_int=|v_#memory_int_426|, #length=|v_#length_396|} OutVars{~res1~0=v_~res1~0_66, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~get3~0.base=v_~get3~0.base_115, ~n3~0=v_~n3~0_92, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_83|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_43|, ~get1~0.base=v_~get1~0.base_69, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_84|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_24|, ~get2~0.offset=v_~get2~0.offset_121, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_37|, #length=|v_#length_394|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~count1~0=v_~count1~0_65, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_186|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_36|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_22|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_51|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_78|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_35|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_37|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_113|, ~get1~0.offset=v_~get1~0.offset_69, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_43|, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_22|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_117|, ~n1~0=v_~n1~0_68, ~count2~0=v_~count2~0_63, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_133|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_41|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_40|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_113|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, ~get2~0.base=v_~get2~0.base_121, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_78|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ~get3~0.offset=v_~get3~0.offset_115, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_247|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_77|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_34|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_36|, ~res2~0=v_~res2~0_72, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_26|, ~n2~0=v_~n2~0_88, ~count3~0=v_~count3~0_65, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_19|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_154|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_449|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_35|, #memory_int=|v_#memory_int_426|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_187|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_37|, ~res3~0=v_~res3~0_72} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~get3~0.base, ~n3~0, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #NULL.offset, ULTIMATE.start_main_#t~ret29#1.offset, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_main_#t~nondet22#1, ~get2~0.offset, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~count1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~mem37#1, ULTIMATE.start_main_#t~pre35#1, ~n1~0, ~count2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_main_~#t3~0#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~get3~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre33#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~nondet26#1, ~res2~0, ULTIMATE.start_main_#t~nondet23#1, ~n2~0, ~count3~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, #valid, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset, ~res3~0] 7370#[L139-6]don't care [1176] L139-6-->L139-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_80|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65| 4) (select |v_#length_194| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|)) (= (select |v_#valid_225| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|) 1) (= (store |v_#memory_int_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65| (store (select |v_#memory_int_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_45|)) |v_#memory_int_218|) (<= 0 .cse1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_98|)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_219|, #length=|v_#length_194|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_81|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_98|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_65|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_65|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_45|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_218|, #length=|v_#length_194|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_80|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_98|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 7372#[L139-6]don't care [1305] L139-6-->L139-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~get1~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~n2~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (= v_~get1~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10| 4))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_18|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|) 1 0) 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ~n2~0=v_~n2~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_10|, ~get1~0.base=v_~get1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~ret28#1.base=|v_ULTIMATE.start_main_#t~ret28#1.base_Out_2|, #length=|v_#length_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_18|, ~get1~0.offset=v_~get1~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|, ULTIMATE.start_main_#t~ret28#1.offset=|v_ULTIMATE.start_main_#t~ret28#1.offset_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret28#1.base, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ~get1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret28#1.offset] 7376#[L139-14]don't care [1213] L139-14-->L139-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_114|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (= (store |v_#memory_int_297| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_297| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_53|)) |v_#memory_int_296|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, #valid=|v_#valid_291|, #memory_int=|v_#memory_int_297|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_114|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_51|, #valid=|v_#valid_291|, #memory_int=|v_#memory_int_296|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_114|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#t~post41#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 7528#[L139-14]don't care [1303] L139-14-->L139-22: Formula: (and (= 0 (select |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~get2~0.offset_Out_2) (= |v_#length_Out_10| (store |v_#length_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= (store |v_#valid_In_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1) |v_#valid_Out_10|) (= v_~get2~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|)) (= v_~n3~0_In_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ~n3~0=v_~n3~0_In_13, #valid=|v_#valid_In_13|, #length=|v_#length_In_13|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n3~0=v_~n3~0_In_13, ULTIMATE.start_create_fresh_int_array_#t~post41#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post41#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base_Out_14|, ~get2~0.base=v_~get2~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet42#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_Out_10|, ~get2~0.offset=v_~get2~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset_Out_14|, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post41#1, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.base, ~get2~0.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet42#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ~get2~0.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc40#1.offset, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7598#[L139-22]don't care [1262] L139-22-->L120-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_322| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_148|)) (= v_~get3~0.offset_95 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_main_#t~pre31#1_39| |v_#pthreadsForks_201|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| v_~get3~0.base_95) (= (select |v_#valid_365| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|) (= (+ |v_#pthreadsForks_201| 1) |v_#pthreadsForks_200|) (= (store |v_#memory_int_369| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_369| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre31#1_39|)) |v_#memory_int_368|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, #pthreadsForks=|v_#pthreadsForks_201|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, #valid=|v_#valid_365|, #memory_int=|v_#memory_int_369|, #length=|v_#length_322|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_148|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~get3~0.base=v_~get3~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_116|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ~get3~0.offset=v_~get3~0.offset_95, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_148|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, #pthreadsForks=|v_#pthreadsForks_200|, #valid=|v_#valid_365|, #memory_int=|v_#memory_int_368|, ULTIMATE.start_main_#t~ret30#1.base=|v_ULTIMATE.start_main_#t~ret30#1.base_27|, ULTIMATE.start_main_#t~ret30#1.offset=|v_ULTIMATE.start_main_#t~ret30#1.offset_27|, #length=|v_#length_322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~get3~0.base, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~ret30#1.base, ULTIMATE.start_main_#t~ret30#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~get3~0.offset] 7596#[L120-3]don't care [930] L120-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre31#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_20, thread1Thread1of1ForFork2_#t~ite6=|v_thread1Thread1of1ForFork2_#t~ite6_10|, thread1Thread1of1ForFork2_#t~ite7=|v_thread1Thread1of1ForFork2_#t~ite7_10|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_6|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_12|, thread1Thread1of1ForFork2_#t~mem3=|v_thread1Thread1of1ForFork2_#t~mem3_12|, thread1Thread1of1ForFork2_#t~mem4=|v_thread1Thread1of1ForFork2_#t~mem4_10|, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, thread1Thread1of1ForFork2_#t~mem5=|v_thread1Thread1of1ForFork2_#t~mem5_10|, thread1Thread1of1ForFork2_~stop~0=v_thread1Thread1of1ForFork2_~stop~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~ite6, thread1Thread1of1ForFork2_#t~ite7, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_#t~mem3, thread1Thread1of1ForFork2_#t~mem4, thread1Thread1of1ForFork2_#t~post1, thread1Thread1of1ForFork2_#t~mem5, thread1Thread1of1ForFork2_~stop~0] 7594#[L120-4, thread1ENTRY]don't care [1097] thread1ENTRY-->L49-6: Formula: (and (= v_~count1~0_31 v_~count2~0_33) (= v_thread1Thread1of1ForFork2_~stop~0_23 0) (= v_thread1Thread1of1ForFork2_~i~0_41 0)) InVars {~count2~0=v_~count2~0_33, ~count1~0=v_~count1~0_31} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_41, ~count2~0=v_~count2~0_33, ~count1~0=v_~count1~0_31, thread1Thread1of1ForFork2_~stop~0=v_thread1Thread1of1ForFork2_~stop~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_~stop~0] 7148#[L49-6, L120-4]don't care [2022-07-22 12:18:37,060 INFO L750 eck$LassoCheckResult]: Loop: 7148#[L49-6, L120-4]don't care [1014] L49-6-->L50-1: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork2_~i~0_29 4))) (let ((.cse1 (+ .cse0 v_~get1~0.offset_17))) (and (<= (+ .cse0 v_~get1~0.offset_17 4) (select |v_#length_72| v_~get1~0.base_17)) (< v_thread1Thread1of1ForFork2_~i~0_29 v_~n2~0_16) (< v_thread1Thread1of1ForFork2_~i~0_29 v_~n1~0_14) (= (select (select |v_#memory_int_78| v_~get1~0.base_17) .cse1) |v_thread1Thread1of1ForFork2_#t~mem2_25|) (= (select |v_#valid_83| v_~get1~0.base_17) 1) (<= 0 .cse1)))) InVars {~n2~0=v_~n2~0_16, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_29, ~n1~0=v_~n1~0_14, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_78|, #length=|v_#length_72|, ~get1~0.offset=v_~get1~0.offset_17, ~get1~0.base=v_~get1~0.base_17} OutVars{~n2~0=v_~n2~0_16, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_25|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_29, ~n1~0=v_~n1~0_14, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_78|, #length=|v_#length_72|, ~get1~0.offset=v_~get1~0.offset_17, ~get1~0.base=v_~get1~0.base_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2] 7146#[L120-4, L50-1]don't care [1196] L50-1-->L49-6: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork2_~i~0_80 4))) (let ((.cse0 (+ v_~get2~0.offset_61 .cse1))) (and (= (select (select |v_#memory_int_268| v_~get2~0.base_61) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2_50|) (= (select |v_#valid_263| v_~get2~0.base_61) 1) (<= (+ v_~get2~0.offset_61 .cse1 4) (select |v_#length_232| v_~get2~0.base_61)) (= v_thread1Thread1of1ForFork2_~i~0_79 (+ v_thread1Thread1of1ForFork2_~i~0_80 1)) (<= 0 .cse0)))) InVars {thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_50|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_80, ~get2~0.offset=v_~get2~0.offset_61, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_268|, ~get2~0.base=v_~get2~0.base_61, #length=|v_#length_232|} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_79, thread1Thread1of1ForFork2_#t~mem3=|v_thread1Thread1of1ForFork2_#t~mem3_43|, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_61, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_268|, ~get2~0.base=v_~get2~0.base_61, #length=|v_#length_232|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~mem3, thread1Thread1of1ForFork2_#t~post1] 7148#[L49-6, L120-4]don't care [2022-07-22 12:18:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1450690616, now seen corresponding path program 1 times [2022-07-22 12:18:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:37,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769885263] [2022-07-22 12:18:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 33591, now seen corresponding path program 3 times [2022-07-22 12:18:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:37,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813931339] [2022-07-22 12:18:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:37,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:18:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1750721854, now seen corresponding path program 1 times [2022-07-22 12:18:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:18:37,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14482967] [2022-07-22 12:18:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:18:37,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:18:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:18:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:18:37,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:18:41,066 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:18:41,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:18:41,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:18:41,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:18:41,067 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:18:41,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:18:41,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:18:41,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:18:41,067 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-word-subst.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:18:41,067 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:18:41,068 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:18:41,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,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 12:18:41,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 12:18:41,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 12:18:41,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:18:41,672 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:18:41,676 INFO L158 Benchmark]: Toolchain (without parser) took 34513.38ms. Allocated memory was 151.0MB in the beginning and 291.5MB in the end (delta: 140.5MB). Free memory was 126.3MB in the beginning and 171.1MB in the end (delta: -44.8MB). Peak memory consumption was 177.0MB. Max. memory is 8.0GB. [2022-07-22 12:18:41,677 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory was 122.2MB in the beginning and 122.1MB in the end (delta: 96.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:18:41,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.79ms. Allocated memory is still 151.0MB. Free memory was 126.1MB in the beginning and 114.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-22 12:18:41,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.11ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:18:41,678 INFO L158 Benchmark]: Boogie Preprocessor took 85.19ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:18:41,679 INFO L158 Benchmark]: RCFGBuilder took 966.80ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 120.5MB in the end (delta: -10.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-07-22 12:18:41,679 INFO L158 Benchmark]: BuchiAutomizer took 33031.43ms. Allocated memory was 151.0MB in the beginning and 291.5MB in the end (delta: 140.5MB). Free memory was 120.5MB in the beginning and 171.1MB in the end (delta: -50.6MB). Peak memory consumption was 170.1MB. Max. memory is 8.0GB. [2022-07-22 12:18:41,682 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.27ms. Allocated memory is still 151.0MB. Free memory was 122.2MB in the beginning and 122.1MB in the end (delta: 96.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.79ms. Allocated memory is still 151.0MB. Free memory was 126.1MB in the beginning and 114.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.11ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.19ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 966.80ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 120.5MB in the end (delta: -10.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 33031.43ms. Allocated memory was 151.0MB in the beginning and 291.5MB in the end (delta: 140.5MB). Free memory was 120.5MB in the beginning and 171.1MB in the end (delta: -50.6MB). Peak memory consumption was 170.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.0s, 302 PlacesBefore, 38 PlacesAfterwards, 327 TransitionsBefore, 39 TransitionsAfterwards, 12480 CoEnabledTransitionPairs, 7 FixpointIterations, 175 TrivialSequentialCompositions, 105 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 372 TotalNumberOfCompositions, 15071 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12506, positive: 12373, positive conditional: 0, positive unconditional: 12373, negative: 133, negative conditional: 0, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9291, positive: 9234, positive conditional: 0, positive unconditional: 9234, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9291, positive: 9234, positive conditional: 0, positive unconditional: 9234, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 241, negative conditional: 0, negative unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12506, positive: 3139, positive conditional: 0, positive unconditional: 3139, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 9291, unknown conditional: 0, unknown unconditional: 9291] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:18:41,731 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...