/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_INTERSECTION -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-08 14:48:50,910 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-08 14:48:51,001 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-09-08 14:48:51,027 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 14:48:51,028 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 14:48:51,028 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 14:48:51,029 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 14:48:51,029 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 14:48:51,030 INFO L137 SettingsManager]: * Use SBE=true [2023-09-08 14:48:51,030 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-08 14:48:51,030 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-08 14:48:51,031 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-08 14:48:51,031 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-08 14:48:51,031 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-08 14:48:51,032 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-08 14:48:51,032 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 14:48:51,032 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-08 14:48:51,037 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-08 14:48:51,037 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 14:48:51,037 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-08 14:48:51,039 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 14:48:51,039 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-08 14:48:51,041 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-08 14:48:51,041 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-08 14:48:51,041 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-08 14:48:51,041 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 14:48:51,041 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-08 14:48:51,042 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-08 14:48:51,042 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-08 14:48:51,042 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 14:48:51,043 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 14:48:51,043 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 14:48:51,043 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 14:48:51,043 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 14:48:51,045 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-08 14:48:51,045 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_INTERSECTION [2023-09-08 14:48:51,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 14:48:51,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 14:48:51,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 14:48:51,321 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 14:48:51,321 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 14:48:51,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-09-08 14:48:52,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 14:48:52,793 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 14:48:52,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-09-08 14:48:52,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409c9ddbb/50018bf82b5a4f2e8d6b7f48a48226d3/FLAG3cc425c66 [2023-09-08 14:48:52,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409c9ddbb/50018bf82b5a4f2e8d6b7f48a48226d3 [2023-09-08 14:48:52,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 14:48:52,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 14:48:52,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 14:48:52,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 14:48:52,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 14:48:52,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:48:52" (1/1) ... [2023-09-08 14:48:52,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d302b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:52, skipping insertion in model container [2023-09-08 14:48:52,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:48:52" (1/1) ... [2023-09-08 14:48:52,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-08 14:48:52,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-08 14:48:53,029 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/unroll-3.wvr.c[2500,2513] [2023-09-08 14:48:53,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:48:53,045 INFO L203 MainTranslator]: Completed pre-run [2023-09-08 14:48:53,063 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/unroll-3.wvr.c[2500,2513] [2023-09-08 14:48:53,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:48:53,080 INFO L208 MainTranslator]: Completed translation [2023-09-08 14:48:53,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53 WrapperNode [2023-09-08 14:48:53,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 14:48:53,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 14:48:53,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 14:48:53,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 14:48:53,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,134 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 145 [2023-09-08 14:48:53,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 14:48:53,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 14:48:53,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 14:48:53,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 14:48:53,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 14:48:53,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 14:48:53,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 14:48:53,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 14:48:53,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (1/1) ... [2023-09-08 14:48:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:48:53,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:48:53,200 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-09-08 14:48:53,210 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-09-08 14:48:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 14:48:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 14:48:53,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 14:48:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 14:48:53,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 14:48:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 14:48:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 14:48:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 14:48:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-08 14:48:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 14:48:53,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 14:48:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 14:48:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 14:48:53,243 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 14:48:53,344 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 14:48:53,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 14:48:53,672 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 14:48:53,678 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 14:48:53,679 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-08 14:48:53,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:48:53 BoogieIcfgContainer [2023-09-08 14:48:53,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 14:48:53,682 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-08 14:48:53,682 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-08 14:48:53,684 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-08 14:48:53,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:48:53,685 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.09 02:48:52" (1/3) ... [2023-09-08 14:48:53,686 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee37d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:48:53, skipping insertion in model container [2023-09-08 14:48:53,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:48:53,686 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:48:53" (2/3) ... [2023-09-08 14:48:53,686 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee37d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:48:53, skipping insertion in model container [2023-09-08 14:48:53,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:48:53,687 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:48:53" (3/3) ... [2023-09-08 14:48:53,688 INFO L332 chiAutomizerObserver]: Analyzing ICFG unroll-3.wvr.c [2023-09-08 14:48:53,775 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 14:48:53,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 168 transitions, 352 flow [2023-09-08 14:48:53,892 INFO L124 PetriNetUnfolderBase]: 15/164 cut-off events. [2023-09-08 14:48:53,893 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-09-08 14:48:53,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 164 events. 15/164 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-09-08 14:48:53,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 168 transitions, 352 flow [2023-09-08 14:48:53,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 164 transitions, 340 flow [2023-09-08 14:48:53,930 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-08 14:48:53,930 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-08 14:48:53,930 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-08 14:48:53,930 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-08 14:48:53,930 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-08 14:48:53,930 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-08 14:48:53,930 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-08 14:48:53,931 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-08 14:48:53,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-08 14:48:55,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-09-08 14:48:55,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:48:55,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:48:55,378 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, 1, 1] [2023-09-08 14:48:55,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:48:55,379 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-08 14:48:55,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-08 14:48:56,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-09-08 14:48:56,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:48:56,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:48:56,160 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, 1, 1] [2023-09-08 14:48:56,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:48:56,168 INFO L748 eck$LassoCheckResult]: Stem: 168#[$Ultimate##0]don't care [258] $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] 173#[L-1]don't care [267] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 177#[L-1-1]don't care [378] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 180#[L21]don't care [342] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 183#[L21-1]don't care [367] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 186#[L21-2]don't care [275] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 189#[L21-3]don't care [326] L21-3-->L21-4: Formula: (and (= (select |v_#length_6| 2) 15) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 192#[L21-4]don't care [303] L21-4-->L42: Formula: (and (= v_~f~0.offset_5 0) (= v_~f~0.base_5 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_5, ~f~0.offset=v_~f~0.offset_5} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 195#[L42]don't care [291] L42-->L42-1: Formula: (= v_~x1~0_4 0) InVars {} OutVars{~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] 198#[L42-1]don't care [369] L42-1-->L42-2: Formula: (= v_~x2~0_10 0) InVars {} OutVars{~x2~0=v_~x2~0_10} AuxVars[] AssignedVars[~x2~0] 201#[L42-2]don't care [300] L42-2-->L43: Formula: (= 0 v_~size~0_5) InVars {} OutVars{~size~0=v_~size~0_5} AuxVars[] AssignedVars[~size~0] 204#[L43]don't care [372] L43-->L-1-2: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 207#[L-1-2]don't care [381] 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] 210#[L-1-3]don't care [387] L-1-3-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_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~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_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_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 213#[L74]don't care [312] L74-->L74-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 216#[L74-1]don't care [344] L74-1-->L74-2: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 219#[L74-2]don't care [351] L74-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 222#[L77]don't care [321] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 225#[L77-1]don't care [331] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 228#[L78]don't care [249] L78-->L78-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 231#[L78-1]don't care [333] L78-1-->L78-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~size~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~size~0=v_~size~0_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~size~0] 234#[L78-2]don't care [269] L78-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 237#[L79]don't care [284] L79-->L79-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~size~0_7) 1 0)) InVars {~size~0=v_~size~0_7} OutVars{~size~0=v_~size~0_7, 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] 240#[L79-1]don't care [364] L79-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] 243#[L37]don't care [294] 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] 246#[L38]don't care [305] 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[] 252#[L37-1]don't care [295] L37-1-->L80: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_8) InVars {~size~0=v_~size~0_8} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_8} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 255#[L80]don't care [242] L80-->L80-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 258#[L80-1]don't care [365] L80-1-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 261#[L96]don't care [358] L96-->L97: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 264#[L97]don't care [316] L97-->L97-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 267#[L97-1]don't care [325] L97-1-->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] 270#[L37-2]don't care [246] 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] 273#[L38-3]don't care [265] 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[] 279#[L37-3]don't care [259] L37-3-->L98: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 282#[L98]don't care [346] L98-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 285#[L37-4]don't care [356] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 288#[L38-6]don't care [339] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 294#[L37-5]don't care [322] L37-5-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 297#[L100]don't care [290] L100-->L100-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_11|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_2| 0) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| 0)) (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_2|, #valid=|v_#valid_12|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset] 300#[L100-1]don't care [314] L100-1-->L100-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 303#[L100-2]don't care [345] L100-2-->L101: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset] 306#[L101]don't care [371] L101-->L101-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 309#[L101-6]don't care [2023-09-08 14:48:56,170 INFO L750 eck$LassoCheckResult]: Loop: 309#[L101-6]don't care [390] L101-6-->L102: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 314#[L102]don't care [271] L102-->L102-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 318#[L102-1]don't care [248] L102-1-->L102-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 324#[L102-2]don't care [270] L102-2-->L101-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 330#[L101-3]don't care [317] L101-3-->L101-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1] 336#[L101-4]don't care [236] L101-4-->L101-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 342#[L101-5]don't care [292] L101-5-->L101-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1] 309#[L101-6]don't care [2023-09-08 14:48:56,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:48:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1921146676, now seen corresponding path program 1 times [2023-09-08 14:48:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:48:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48758753] [2023-09-08 14:48:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:48:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:48:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:48:56,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:48:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:48:56,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:48:56,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:48:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -617150699, now seen corresponding path program 1 times [2023-09-08 14:48:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:48:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754276625] [2023-09-08 14:48:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:48:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:48:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:48:56,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:48:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:48:56,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:48:56,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:48:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash 871872642, now seen corresponding path program 1 times [2023-09-08 14:48:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:48:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671061197] [2023-09-08 14:48:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:48:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:48:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:48:56,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:48:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:48:56,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:48:57,661 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:48:57,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:48:57,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:48:57,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:48:57,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-08 14:48:57,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:48:57,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:48:57,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:48:57,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-3.wvr.c_BEv2_Iteration1_Lasso [2023-09-08 14:48:57,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:48:57,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:48:57,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:57,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:48:58,628 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:48:58,632 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-08 14:48:58,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:48:58,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:48:58,638 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-09-08 14:48:58,639 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-09-08 14:48:58,640 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-09-08 14:48:58,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:48:58,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:48:58,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:48:58,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:48:58,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:48:58,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:48:58,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:48:58,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:48:58,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-09-08 14:48:58,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:48:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:48:58,662 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-09-08 14:48:58,664 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-09-08 14:48:58,671 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-09-08 14:48:58,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:48:58,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:48:58,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:48:58,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:48:58,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:48:58,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:48:58,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-08 14:48:58,740 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2023-09-08 14:48:58,741 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-09-08 14:48:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:48:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:48:58,784 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-09-08 14:48:58,785 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-09-08 14:48:58,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-08 14:48:58,804 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-09-08 14:48:58,805 INFO L513 LassoAnalysis]: Proved termination. [2023-09-08 14:48:58,805 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ~size~0) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*~size~0 Supporting invariants [1*~size~0 - 1*ULTIMATE.start_create_fresh_int_array_~size#1 >= 0] [2023-09-08 14:48:58,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-08 14:48:58,859 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2023-09-08 14:48:58,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:48:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:48:58,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-08 14:48:58,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:48:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:48:59,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-08 14:48:59,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:48:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:48:59,205 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-09-08 14:48:59,208 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-09-08 14:48:59,775 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-09-08 14:49:00,550 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 110792 states and 316893 transitions. Complement of second has 11 states. [2023-09-08 14:49:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-08 14:49:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-09-08 14:49:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 296 transitions. [2023-09-08 14:49:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 296 transitions. Stem has 43 letters. Loop has 7 letters. [2023-09-08 14:49:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:49:00,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 296 transitions. Stem has 50 letters. Loop has 7 letters. [2023-09-08 14:49:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:49:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 296 transitions. Stem has 43 letters. Loop has 14 letters. [2023-09-08 14:49:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:49:00,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110792 states and 316893 transitions. [2023-09-08 14:49:02,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:49:02,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110792 states to 0 states and 0 transitions. [2023-09-08 14:49:02,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-08 14:49:02,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-08 14:49:02,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-08 14:49:02,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:49:02,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:49:02,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:49:02,187 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:49:02,188 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-08 14:49:02,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-08 14:49:02,188 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:49:02,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-08 14:49:02,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.09 02:49:02 BoogieIcfgContainer [2023-09-08 14:49:02,194 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-08 14:49:02,194 INFO L158 Benchmark]: Toolchain (without parser) took 9369.64ms. Allocated memory was 283.1MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 236.7MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 355.5MB. Max. memory is 8.0GB. [2023-09-08 14:49:02,195 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-08 14:49:02,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.59ms. Allocated memory is still 283.1MB. Free memory was 236.3MB in the beginning and 224.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-08 14:49:02,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.97ms. Allocated memory is still 283.1MB. Free memory was 224.7MB in the beginning and 223.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:49:02,196 INFO L158 Benchmark]: Boogie Preprocessor took 35.81ms. Allocated memory is still 283.1MB. Free memory was 223.1MB in the beginning and 221.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-08 14:49:02,197 INFO L158 Benchmark]: RCFGBuilder took 509.45ms. Allocated memory is still 283.1MB. Free memory was 221.6MB in the beginning and 203.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-09-08 14:49:02,197 INFO L158 Benchmark]: BuchiAutomizer took 8511.85ms. Allocated memory was 283.1MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 203.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 321.9MB. Max. memory is 8.0GB. [2023-09-08 14:49:02,199 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.12ms. Allocated memory is still 192.9MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.59ms. Allocated memory is still 283.1MB. Free memory was 236.3MB in the beginning and 224.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.97ms. Allocated memory is still 283.1MB. Free memory was 224.7MB in the beginning and 223.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.81ms. Allocated memory is still 283.1MB. Free memory was 223.1MB in the beginning and 221.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 509.45ms. Allocated memory is still 283.1MB. Free memory was 221.6MB in the beginning and 203.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 8511.85ms. Allocated memory was 283.1MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 203.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 321.9MB. 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 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.6s. 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 1.6s 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, 156 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 428 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 127 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax115 hnf100 lsp73 ukn73 mio100 lsp40 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 144ms VariablesStem: 10 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-08 14:49:02,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...