/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/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs FAIRNESS_LAZY -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-a3464b2-m [2023-08-18 17:17:22,694 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-08-18 17:17:22,729 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-08-18 17:17:22,744 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-18 17:17:22,745 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-18 17:17:22,745 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-18 17:17:22,746 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-18 17:17:22,746 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-08-18 17:17:22,746 INFO L137 SettingsManager]: * Use SBE=true [2023-08-18 17:17:22,747 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-08-18 17:17:22,747 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-08-18 17:17:22,747 INFO L137 SettingsManager]: * Use old map elimination=false [2023-08-18 17:17:22,747 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-08-18 17:17:22,748 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-08-18 17:17:22,748 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-08-18 17:17:22,748 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-18 17:17:22,748 INFO L137 SettingsManager]: * sizeof long=4 [2023-08-18 17:17:22,748 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-18 17:17:22,749 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-18 17:17:22,749 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-08-18 17:17:22,749 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-08-18 17:17:22,749 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-08-18 17:17:22,750 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-08-18 17:17:22,750 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-08-18 17:17:22,750 INFO L137 SettingsManager]: * sizeof long double=12 [2023-08-18 17:17:22,750 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-08-18 17:17:22,750 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-08-18 17:17:22,750 INFO L137 SettingsManager]: * Use constant arrays=true [2023-08-18 17:17:22,751 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-08-18 17:17:22,751 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-18 17:17:22,751 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-18 17:17:22,751 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-18 17:17:22,751 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-18 17:17:22,752 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-08-18 17:17:22,752 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-08-18 17:17:22,752 INFO L137 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> FAIRNESS_LAZY [2023-08-18 17:17:22,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-18 17:17:22,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-18 17:17:22,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-18 17:17:22,954 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-18 17:17:22,955 INFO L274 PluginConnector]: CDTParser initialized [2023-08-18 17:17:22,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-18 17:17:23,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-18 17:17:24,102 INFO L384 CDTParser]: Found 1 translation units. [2023-08-18 17:17:24,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-18 17:17:24,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8198863c/1304f85d96594e68874b6588c5c40aef/FLAGe0e56fadd [2023-08-18 17:17:24,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8198863c/1304f85d96594e68874b6588c5c40aef [2023-08-18 17:17:24,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-18 17:17:24,120 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-18 17:17:24,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-18 17:17:24,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-18 17:17:24,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-18 17:17:24,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03ae9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24, skipping insertion in model container [2023-08-18 17:17:24,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-18 17:17:24,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-18 17:17:24,259 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-18 17:17:24,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 17:17:24,273 INFO L203 MainTranslator]: Completed pre-run [2023-08-18 17:17:24,287 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-18 17:17:24,295 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 17:17:24,305 INFO L208 MainTranslator]: Completed translation [2023-08-18 17:17:24,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24 WrapperNode [2023-08-18 17:17:24,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-18 17:17:24,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-18 17:17:24,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-18 17:17:24,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-18 17:17:24,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,336 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2023-08-18 17:17:24,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-18 17:17:24,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-18 17:17:24,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-18 17:17:24,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-18 17:17:24,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-18 17:17:24,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-18 17:17:24,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-18 17:17:24,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-18 17:17:24,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (1/1) ... [2023-08-18 17:17:24,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:24,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:24,398 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) [2023-08-18 17:17:24,413 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 [2023-08-18 17:17:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-18 17:17:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-18 17:17:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-18 17:17:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-18 17:17:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-18 17:17:24,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-18 17:17:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-18 17:17:24,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-18 17:17:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-18 17:17:24,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-18 17:17:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-18 17:17:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-18 17:17:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-18 17:17:24,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-18 17:17:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-18 17:17:24,441 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-18 17:17:24,533 INFO L236 CfgBuilder]: Building ICFG [2023-08-18 17:17:24,535 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-18 17:17:24,815 INFO L277 CfgBuilder]: Performing block encoding [2023-08-18 17:17:24,822 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-18 17:17:24,822 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-18 17:17:24,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:17:24 BoogieIcfgContainer [2023-08-18 17:17:24,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-18 17:17:24,824 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-08-18 17:17:24,824 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-08-18 17:17:24,826 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-08-18 17:17:24,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 17:17:24,827 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.08 05:17:24" (1/3) ... [2023-08-18 17:17:24,828 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7951099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 05:17:24, skipping insertion in model container [2023-08-18 17:17:24,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 17:17:24,828 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:17:24" (2/3) ... [2023-08-18 17:17:24,828 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7951099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 05:17:24, skipping insertion in model container [2023-08-18 17:17:24,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 17:17:24,828 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:17:24" (3/3) ... [2023-08-18 17:17:24,829 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-08-18 17:17:24,892 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-18 17:17:24,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 149 transitions, 322 flow [2023-08-18 17:17:24,948 INFO L124 PetriNetUnfolderBase]: 12/143 cut-off events. [2023-08-18 17:17:24,948 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-18 17:17:24,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 12/143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 99 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-08-18 17:17:24,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 149 transitions, 322 flow [2023-08-18 17:17:24,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 143 transitions, 304 flow [2023-08-18 17:17:24,968 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-08-18 17:17:24,968 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-08-18 17:17:24,968 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-08-18 17:17:24,968 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-08-18 17:17:24,968 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-08-18 17:17:24,968 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-08-18 17:17:24,968 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-08-18 17:17:24,968 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-08-18 17:17:24,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-08-18 17:17:29,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-08-18 17:17:29,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 17:17:29,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 17:17:29,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 17:17:29,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-18 17:17:29,738 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-08-18 17:17:29,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-08-18 17:17:32,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-08-18 17:17:32,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 17:17:32,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 17:17:32,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 17:17:32,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-18 17:17:32,518 INFO L748 eck$LassoCheckResult]: Stem: 156#[$Ultimate##0]don't care [216] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 162#[L-1]don't care [228] L-1-->L-1-1: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 167#[L-1-1]don't care [331] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 170#[L21]don't care [296] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 173#[L21-1]don't care [320] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 176#[L21-2]don't care [234] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 179#[L21-3]don't care [283] L21-3-->L21-4: Formula: (and (= 32 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 182#[L21-4]don't care [255] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 185#[L42]don't care [242] L42-->L42-1: Formula: (= v_~sum1~0_3 0) InVars {} OutVars{~sum1~0=v_~sum1~0_3} AuxVars[] AssignedVars[~sum1~0] 188#[L42-1]don't care [321] L42-1-->L42-2: Formula: (= v_~sum2~0_3 0) InVars {} OutVars{~sum2~0=v_~sum2~0_3} AuxVars[] AssignedVars[~sum2~0] 191#[L42-2]don't care [250] L42-2-->L43: Formula: (= v_~sum3~0_3 0) InVars {} OutVars{~sum3~0=v_~sum3~0_3} AuxVars[] AssignedVars[~sum3~0] 194#[L43]don't care [326] L43-->L43-1: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 197#[L43-1]don't care [222] L43-1-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 200#[L-1-2]don't care [332] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 203#[L-1-3]don't care [335] L-1-3-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 206#[L72]don't care [259] L72-->L72-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 209#[L72-1]don't care [265] L72-1-->L72-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 212#[L72-2]don't care [203] L72-2-->L72-3: Formula: (and (= |v_#valid_11| (store |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 215#[L72-3]don't care [230] L72-3-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 218#[L75]don't care [246] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~M~0] 221#[L75-1]don't care [215] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 224#[L76]don't care [260] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 227#[L76-1]don't care [318] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 230#[L76-2]don't care [327] L76-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 233#[L77]don't care [274] L77-->L77-1: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#in~size#1] 236#[L77-1]don't care [289] L77-1-->L77-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 239#[L77-2]don't care [229] L77-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_1|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 242#[L95]don't care [290] L95-->L96: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~size#1] 245#[L96]don't care [310] L96-->L96-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 248#[L96-1]don't care [266] L96-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 251#[L37]don't care [243] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 254#[L38]don't care [257] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 260#[L37-1]don't care [244] L37-1-->L97: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_4| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 263#[L97]don't care [272] L97-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 266#[L37-2]don't care [209] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 269#[L38-3]don't care [224] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 274#[L37-3]don't care [218] L37-3-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 278#[L99]don't care [302] L99-->L99-1: Formula: (and (= (store |v_#length_13| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_5| 1073741824))) |v_#length_12|) (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 0)) (= |v_#valid_13| (store |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_5|) (= (select |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2|, #valid=|v_#valid_13|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, #length] 281#[L99-1]don't care [232] L99-1-->L99-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 284#[L99-2]don't care [313] L99-2-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_4|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base] 287#[L100]don't care [241] L100-->L100-6: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 290#[L100-6]don't care [2023-08-18 17:17:32,519 INFO L750 eck$LassoCheckResult]: Loop: 290#[L100-6]don't care [278] L100-6-->L101: Formula: (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|} AuxVars[] AssignedVars[] 295#[L101]don't care [324] L101-->L101-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1] 299#[L101-1]don't care [210] L101-1-->L101-2: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_14| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_15| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_3|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_3|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 305#[L101-2]don't care [282] L101-2-->L100-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1] 311#[L100-3]don't care [300] L100-3-->L100-4: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6| |v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 317#[L100-4]don't care [202] L100-4-->L100-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_7|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 323#[L100-5]don't care [308] L100-5-->L100-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 290#[L100-6]don't care [2023-08-18 17:17:32,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 17:17:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 589995158, now seen corresponding path program 1 times [2023-08-18 17:17:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 17:17:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894751531] [2023-08-18 17:17:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 17:17:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 17:17:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 17:17:32,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 17:17:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 17:17:32,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 17:17:32,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 17:17:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash 249276159, now seen corresponding path program 1 times [2023-08-18 17:17:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 17:17:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146605746] [2023-08-18 17:17:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 17:17:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 17:17:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 17:17:32,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 17:17:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 17:17:32,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 17:17:32,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 17:17:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1780963126, now seen corresponding path program 1 times [2023-08-18 17:17:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 17:17:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760150321] [2023-08-18 17:17:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 17:17:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 17:17:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 17:17:32,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 17:17:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 17:17:32,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 17:17:34,010 INFO L210 LassoAnalysis]: Preferences: [2023-08-18 17:17:34,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-08-18 17:17:34,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-08-18 17:17:34,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-08-18 17:17:34,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-08-18 17:17:34,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-08-18 17:17:34,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-08-18 17:17:34,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration1_Lasso [2023-08-18 17:17:34,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-08-18 17:17:34,012 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-08-18 17:17:34,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 17:17:34,777 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-08-18 17:17:34,780 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-08-18 17:17:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:34,783 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) [2023-08-18 17:17:34,790 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 [2023-08-18 17:17:34,791 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 [2023-08-18 17:17:34,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:34,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 17:17:34,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:34,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:34,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:34,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 17:17:34,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 17:17:34,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:34,822 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 [2023-08-18 17:17:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:34,833 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) [2023-08-18 17:17:34,865 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 [2023-08-18 17:17:34,867 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 [2023-08-18 17:17:34,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:34,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 17:17:34,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:34,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:34,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:34,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 17:17:34,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 17:17:34,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:34,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-08-18 17:17:34,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:34,901 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) [2023-08-18 17:17:34,903 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 [2023-08-18 17:17:34,904 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 [2023-08-18 17:17:34,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:34,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:34,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:34,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:34,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:34,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:34,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:34,932 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 [2023-08-18 17:17:34,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:34,933 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) [2023-08-18 17:17:34,935 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 [2023-08-18 17:17:34,937 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 [2023-08-18 17:17:34,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:34,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 17:17:34,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:34,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:34,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:34,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 17:17:34,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 17:17:34,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:34,962 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 [2023-08-18 17:17:34,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:34,963 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) [2023-08-18 17:17:34,965 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 [2023-08-18 17:17:34,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 17:17:34,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:34,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:34,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:34,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:34,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:34,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:34,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:34,995 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 [2023-08-18 17:17:34,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:34,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:34,997 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) [2023-08-18 17:17:34,998 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 [2023-08-18 17:17:35,000 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 [2023-08-18 17:17:35,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,027 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 [2023-08-18 17:17:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,029 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) [2023-08-18 17:17:35,031 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 [2023-08-18 17:17:35,032 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 [2023-08-18 17:17:35,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-08-18 17:17:35,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,069 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) [2023-08-18 17:17:35,071 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 [2023-08-18 17:17:35,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 17:17:35,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 17:17:35,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 17:17:35,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 17:17:35,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,097 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 [2023-08-18 17:17:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,099 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) [2023-08-18 17:17:35,100 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 [2023-08-18 17:17:35,102 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 [2023-08-18 17:17:35,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,128 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 [2023-08-18 17:17:35,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,129 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) [2023-08-18 17:17:35,131 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 [2023-08-18 17:17:35,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 17:17:35,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,160 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 [2023-08-18 17:17:35,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,161 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) [2023-08-18 17:17:35,163 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 [2023-08-18 17:17:35,164 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 [2023-08-18 17:17:35,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,193 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 [2023-08-18 17:17:35,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,194 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) [2023-08-18 17:17:35,209 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 [2023-08-18 17:17:35,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 17:17:35,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,253 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 [2023-08-18 17:17:35,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,254 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) [2023-08-18 17:17:35,257 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 [2023-08-18 17:17:35,258 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 [2023-08-18 17:17:35,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,286 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 [2023-08-18 17:17:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,288 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) [2023-08-18 17:17:35,290 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 [2023-08-18 17:17:35,291 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 [2023-08-18 17:17:35,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,317 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 [2023-08-18 17:17:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,318 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) [2023-08-18 17:17:35,320 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 [2023-08-18 17:17:35,322 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 [2023-08-18 17:17:35,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 17:17:35,411 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 [2023-08-18 17:17:35,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,413 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) [2023-08-18 17:17:35,415 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 [2023-08-18 17:17:35,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 17:17:35,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 17:17:35,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 17:17:35,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 17:17:35,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 17:17:35,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 17:17:35,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 17:17:35,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-08-18 17:17:35,467 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-08-18 17:17:35,468 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-08-18 17:17:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 17:17:35,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 17:17:35,503 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) [2023-08-18 17:17:35,504 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 [2023-08-18 17:17:35,505 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-08-18 17:17:35,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-08-18 17:17:35,527 INFO L513 LassoAnalysis]: Proved termination. [2023-08-18 17:17:35,528 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1) = -1*ULTIMATE.start_create_fresh_uint_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_uint_array_~size#1 Supporting invariants [] [2023-08-18 17:17:35,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-08-18 17:17:35,580 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2023-08-18 17:17:35,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 17:17:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 17:17:35,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-18 17:17:35,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-18 17:17:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 17:17:35,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-18 17:17:35,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-18 17:17:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 17:17:35,753 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-08-18 17:17:35,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2023-08-18 17:17:36,567 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 [2023-08-18 17:17:43,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 442317 states and 1718179 transitions. Complement of second has 9 states. [2023-08-18 17:17:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-08-18 17:17:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2023-08-18 17:17:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2023-08-18 17:17:43,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 246 transitions. Stem has 41 letters. Loop has 7 letters. [2023-08-18 17:17:43,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 17:17:43,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 246 transitions. Stem has 48 letters. Loop has 7 letters. [2023-08-18 17:17:43,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 17:17:43,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 246 transitions. Stem has 41 letters. Loop has 14 letters. [2023-08-18 17:17:43,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 17:17:43,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442317 states and 1718179 transitions. [2023-08-18 17:17:51,483 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-08-18 17:17:51,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442317 states to 0 states and 0 transitions. [2023-08-18 17:17:51,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-08-18 17:17:51,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-08-18 17:17:51,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-08-18 17:17:51,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 17:17:51,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-08-18 17:17:51,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-08-18 17:17:51,486 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-08-18 17:17:51,486 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-08-18 17:17:51,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-08-18 17:17:51,486 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-08-18 17:17:51,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-08-18 17:17:51,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.08 05:17:51 BoogieIcfgContainer [2023-08-18 17:17:51,491 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-08-18 17:17:51,491 INFO L158 Benchmark]: Toolchain (without parser) took 27370.87ms. Allocated memory was 290.5MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 251.1MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-08-18 17:17:51,491 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-08-18 17:17:51,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.31ms. Allocated memory is still 290.5MB. Free memory was 250.6MB in the beginning and 239.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-08-18 17:17:51,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.76ms. Allocated memory is still 290.5MB. Free memory was 239.6MB in the beginning and 237.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-08-18 17:17:51,492 INFO L158 Benchmark]: Boogie Preprocessor took 19.55ms. Allocated memory is still 290.5MB. Free memory was 237.5MB in the beginning and 235.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-08-18 17:17:51,493 INFO L158 Benchmark]: RCFGBuilder took 465.94ms. Allocated memory is still 290.5MB. Free memory was 235.9MB in the beginning and 218.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-08-18 17:17:51,493 INFO L158 Benchmark]: BuchiAutomizer took 26666.81ms. Allocated memory was 290.5MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 218.6MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-08-18 17:17:51,494 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.31ms. Allocated memory is still 290.5MB. Free memory was 250.6MB in the beginning and 239.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.76ms. Allocated memory is still 290.5MB. Free memory was 239.6MB in the beginning and 237.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.55ms. Allocated memory is still 290.5MB. Free memory was 237.5MB in the beginning and 235.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 465.94ms. Allocated memory is still 290.5MB. Free memory was 235.9MB in the beginning and 218.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 26666.81ms. Allocated memory was 290.5MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 218.6MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 7.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 114 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax120 hnf100 lsp70 ukn69 mio100 lsp37 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-08-18 17:17:51,516 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...