./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/count_up_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f12e3955ea6fcca41dc2c68fc8e1d5a42d0369455d727c76f4dfb832d3060ba5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:41,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:41,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:41,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:41,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:41,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:41,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:41,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:41,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:41,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:41,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:41,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:41,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:41,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:41,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:41,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:41,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:41,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:41,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:41,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:41,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:41,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:41,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:41,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:41,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:41,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:41,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:41,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:41,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:41,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:41,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:41,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:41,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:41,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:41,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:41,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:41,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:41,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:41,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:41,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:41,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:41,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:34:41,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:41,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:41,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:41,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:41,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:41,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:41,732 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:41,732 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:41,732 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:41,733 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:41,733 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:41,733 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:41,734 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:41,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:41,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:41,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:41,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:41,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:41,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:41,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:41,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:41,735 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:41,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:41,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:41,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:41,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:41,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:41,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:41,737 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:41,737 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f12e3955ea6fcca41dc2c68fc8e1d5a42d0369455d727c76f4dfb832d3060ba5 [2022-02-21 03:34:41,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:41,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:41,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:41,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:41,979 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:41,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_alloca.i [2022-02-21 03:34:42,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa84a8e3c/c3308e2a9ee64dc6beda1d9a05efeeb8/FLAG4eede76cf [2022-02-21 03:34:42,426 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:42,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_alloca.i [2022-02-21 03:34:42,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa84a8e3c/c3308e2a9ee64dc6beda1d9a05efeeb8/FLAG4eede76cf [2022-02-21 03:34:42,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa84a8e3c/c3308e2a9ee64dc6beda1d9a05efeeb8 [2022-02-21 03:34:42,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:42,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:42,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:42,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:42,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:42,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e66a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42, skipping insertion in model container [2022-02-21 03:34:42,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:42,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:42,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:42,789 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:42,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:42,854 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:42,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42 WrapperNode [2022-02-21 03:34:42,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:42,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:42,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:42,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:42,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,900 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2022-02-21 03:34:42,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:42,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:42,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:42,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:42,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:42,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:42,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:42,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:42,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (1/1) ... [2022-02-21 03:34:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:42,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:43,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:34:43,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:43,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:43,080 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:43,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:43,249 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:43,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:43,254 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:34:43,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:43 BoogieIcfgContainer [2022-02-21 03:34:43,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:43,257 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:43,257 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:43,259 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:43,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:43,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:42" (1/3) ... [2022-02-21 03:34:43,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7696152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:43, skipping insertion in model container [2022-02-21 03:34:43,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:43,261 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:42" (2/3) ... [2022-02-21 03:34:43,261 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7696152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:43, skipping insertion in model container [2022-02-21 03:34:43,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:43,261 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:43" (3/3) ... [2022-02-21 03:34:43,262 INFO L388 chiAutomizerObserver]: Analyzing ICFG count_up_alloca.i [2022-02-21 03:34:43,298 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:43,298 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:43,298 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:43,298 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:43,298 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:43,298 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:43,298 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:43,299 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:43,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:43,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:34:43,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:43,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:43,325 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:43,325 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:34:43,325 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:43,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:43,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:34:43,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:43,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:43,328 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:43,329 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:34:43,333 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~nondet206#1, main_#t~malloc207#1.base, main_#t~malloc207#1.offset, main_#t~nondet209#1, main_#t~post208#1, main_#t~mem212#1, main_#t~post213#1, main_#t~mem211#1, main_#t~post210#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~limit~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~limit~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet206#1;havoc main_#t~nondet206#1; 7#L369true assume !(main_~length~0#1 < 1); 12#L369-2true call main_#t~malloc207#1.base, main_#t~malloc207#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc207#1.base, main_#t~malloc207#1.offset; 15#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 18#L372-3true [2022-02-21 03:34:43,333 INFO L793 eck$LassoCheckResult]: Loop: 18#L372-3true assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet209#1;havoc main_#t~nondet209#1; 20#L374true assume main_~val~0#1 > main_~limit~0#1;main_~val~0#1 := main_~limit~0#1; 4#L374-2true call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17#L372-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 18#L372-3true [2022-02-21 03:34:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:43,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:43,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240593184] [2022-02-21 03:34:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:43,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:43,462 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2022-02-21 03:34:43,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:43,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226947189] [2022-02-21 03:34:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:43,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:43,510 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2022-02-21 03:34:43,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:43,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831324781] [2022-02-21 03:34:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:43,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:43,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:43,581 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:43,867 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:43,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:43,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:43,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:43,868 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:43,868 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,868 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:43,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:43,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration1_Lasso [2022-02-21 03:34:43,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:43,869 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:43,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:43,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:43,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:43,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:43,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:44,284 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:44,287 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:44,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:34:44,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:44,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:44,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:34:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:34:44,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:44,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:44,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:44,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:34:44,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:44,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:44,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:44,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:34:44,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:44,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:44,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:44,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:34:44,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:44,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:44,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:34:44,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:44,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:44,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:44,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:34:44,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:44,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:44,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:34:44,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:44,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:44,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:34:44,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:44,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:44,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:44,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:44,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:34:44,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:44,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:44,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:44,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:44,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:44,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:44,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:44,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:44,842 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-02-21 03:34:44,842 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:34:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:44,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:34:44,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:44,867 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:44,868 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:44,868 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc207#1.base)_1) = -4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc207#1.base)_1 Supporting invariants [] [2022-02-21 03:34:44,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,916 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:44,933 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet209#1;havoc main_#t~nondet209#1;" "assume main_~val~0#1 > main_~limit~0#1;main_~val~0#1 := main_~limit~0#1;" "call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" [2022-02-21 03:34:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:45,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:45,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:45,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2022-02-21 03:34:45,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~nondet206#1, main_#t~malloc207#1.base, main_#t~malloc207#1.offset, main_#t~nondet209#1, main_#t~post208#1, main_#t~mem212#1, main_#t~post213#1, main_#t~mem211#1, main_#t~post210#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~limit~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~limit~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet206#1;havoc main_#t~nondet206#1; {28#unseeded} is VALID [2022-02-21 03:34:45,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:34:45,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#unseeded} call main_#t~malloc207#1.base, main_#t~malloc207#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc207#1.base, main_#t~malloc207#1.offset; {57#(and unseeded (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} is VALID [2022-02-21 03:34:45,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#(and unseeded (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {57#(and unseeded (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} is VALID [2022-02-21 03:34:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:45,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:34:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:45,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:45,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet209#1;havoc main_#t~nondet209#1; {58#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} is VALID [2022-02-21 03:34:45,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} assume main_~val~0#1 > main_~limit~0#1;main_~val~0#1 := main_~limit~0#1; {58#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} is VALID [2022-02-21 03:34:45,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {58#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {84#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} is VALID [2022-02-21 03:34:45,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {84#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {60#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc207#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))) unseeded) (= |ULTIMATE.start_main_~arr~0#1.base| |ULTIMATE.start_main_#t~malloc207#1.base|))} is VALID [2022-02-21 03:34:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:45,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:45,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:34:45,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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). Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 57 transitions. Complement of second has 9 states. [2022-02-21 03:34:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:45,273 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:45,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:34:45,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:45,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:45,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:45,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:45,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:45,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2022-02-21 03:34:45,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:45,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:45,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:45,280 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:34:45,283 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:34:45,283 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:45,285 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:45,285 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 57 transitions. cyclomatic complexity: 21 [2022-02-21 03:34:45,285 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:34:45,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:34:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:34:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:34:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:34:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:34:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:34:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:34:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:34:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:34:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:34:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:34:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:34:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:34:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:34:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:34:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:34:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:34:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:34:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:45,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:45,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:45,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:45,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:45,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:34:45,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,313 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-21 03:34:45,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:34:45,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:34:45,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:34:45,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:45,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. cyclomatic complexity: 21 [2022-02-21 03:34:45,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:45,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 15 states and 20 transitions. [2022-02-21 03:34:45,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:34:45,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:34:45,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-02-21 03:34:45,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:45,324 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:34:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-02-21 03:34:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:34:45,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:45,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,340 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,341 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:45,344 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:34:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:34:45,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:45,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:45,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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) Second operand 15 states and 20 transitions. [2022-02-21 03:34:45,345 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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) Second operand 15 states and 20 transitions. [2022-02-21 03:34:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:45,345 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:34:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:34:45,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:45,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:45,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:45,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 03:34:45,347 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:34:45,347 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:34:45,347 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:45,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:34:45,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:45,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:45,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:45,348 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:45,348 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:34:45,348 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~nondet206#1, main_#t~malloc207#1.base, main_#t~malloc207#1.offset, main_#t~nondet209#1, main_#t~post208#1, main_#t~mem212#1, main_#t~post213#1, main_#t~mem211#1, main_#t~post210#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~limit~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~limit~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet206#1;havoc main_#t~nondet206#1; 148#L369 assume !(main_~length~0#1 < 1); 149#L369-2 call main_#t~malloc207#1.base, main_#t~malloc207#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc207#1.base, main_#t~malloc207#1.offset; 153#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 154#L372-3 assume !(main_~i~0#1 < main_~length~0#1); 152#L372-4 main_~j~0#1 := 0; 145#L379-3 [2022-02-21 03:34:45,348 INFO L793 eck$LassoCheckResult]: Loop: 145#L379-3 assume !!(main_~j~0#1 < main_~length~0#1); 150#L380-3 call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 151#L380-1 assume !(main_#t~mem211#1 < main_~limit~0#1);havoc main_#t~mem211#1; 144#L379-2 main_#t~post210#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post210#1;havoc main_#t~post210#1; 145#L379-3 [2022-02-21 03:34:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2022-02-21 03:34:45,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:45,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861655999] [2022-02-21 03:34:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:45,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {190#true} is VALID [2022-02-21 03:34:45,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~nondet206#1, main_#t~malloc207#1.base, main_#t~malloc207#1.offset, main_#t~nondet209#1, main_#t~post208#1, main_#t~mem212#1, main_#t~post213#1, main_#t~mem211#1, main_#t~post210#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~limit~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~limit~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet206#1;havoc main_#t~nondet206#1; {190#true} is VALID [2022-02-21 03:34:45,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume !(main_~length~0#1 < 1); {192#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:45,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {192#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc207#1.base, main_#t~malloc207#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc207#1.base, main_#t~malloc207#1.offset; {192#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:45,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {193#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:45,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {191#false} is VALID [2022-02-21 03:34:45,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#false} main_~j~0#1 := 0; {191#false} is VALID [2022-02-21 03:34:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:45,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:45,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861655999] [2022-02-21 03:34:45,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861655999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:45,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:45,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:45,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445970694] [2022-02-21 03:34:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:45,411 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2022-02-21 03:34:45,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:45,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252867995] [2022-02-21 03:34:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,442 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:45,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:45,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:45,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:45,517 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:45,553 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:34:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:45,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:45,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:34:45,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:45,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2022-02-21 03:34:45,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:34:45,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:34:45,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2022-02-21 03:34:45,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:45,564 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 03:34:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2022-02-21 03:34:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2022-02-21 03:34:45,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:45,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,566 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,566 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:45,567 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:34:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:34:45,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:45,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:45,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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) Second operand 18 states and 23 transitions. [2022-02-21 03:34:45,568 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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) Second operand 18 states and 23 transitions. [2022-02-21 03:34:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:45,570 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:34:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:34:45,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:45,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:45,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:45,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-02-21 03:34:45,570 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:34:45,570 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:34:45,570 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:45,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:34:45,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:34:45,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:45,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:45,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:45,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:34:45,571 INFO L791 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~nondet206#1, main_#t~malloc207#1.base, main_#t~malloc207#1.offset, main_#t~nondet209#1, main_#t~post208#1, main_#t~mem212#1, main_#t~post213#1, main_#t~mem211#1, main_#t~post210#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~limit~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~limit~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet206#1;havoc main_#t~nondet206#1; 220#L369 assume !(main_~length~0#1 < 1); 221#L369-2 call main_#t~malloc207#1.base, main_#t~malloc207#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc207#1.base, main_#t~malloc207#1.offset; 224#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 226#L372-3 assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet209#1;havoc main_#t~nondet209#1; 228#L374 assume !(main_~val~0#1 > main_~limit~0#1); 214#L374-2 call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 215#L372-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 227#L372-3 assume !(main_~i~0#1 < main_~length~0#1); 225#L372-4 main_~j~0#1 := 0; 219#L379-3 [2022-02-21 03:34:45,571 INFO L793 eck$LassoCheckResult]: Loop: 219#L379-3 assume !!(main_~j~0#1 < main_~length~0#1); 222#L380-3 call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 223#L380-1 assume !(main_#t~mem211#1 < main_~limit~0#1);havoc main_#t~mem211#1; 218#L379-2 main_#t~post210#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post210#1;havoc main_#t~post210#1; 219#L379-3 [2022-02-21 03:34:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2022-02-21 03:34:45,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:45,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764938306] [2022-02-21 03:34:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,594 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2022-02-21 03:34:45,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:45,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069485570] [2022-02-21 03:34:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,602 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2022-02-21 03:34:45,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:45,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665585629] [2022-02-21 03:34:45,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:45,629 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:45,846 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:45,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:45,847 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:45,847 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:45,847 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:45,847 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:45,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:45,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:45,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration3_Lasso [2022-02-21 03:34:45,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:45,847 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:45,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:45,879 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:34:45,882 INFO L158 Benchmark]: Toolchain (without parser) took 3421.67ms. Allocated memory was 109.1MB in the beginning and 144.7MB in the end (delta: 35.7MB). Free memory was 80.5MB in the beginning and 75.5MB in the end (delta: 5.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-02-21 03:34:45,882 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:45,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.10ms. Allocated memory is still 109.1MB. Free memory was 80.5MB in the beginning and 76.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:34:45,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:34:45,883 INFO L158 Benchmark]: Boogie Preprocessor took 17.77ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:45,883 INFO L158 Benchmark]: RCFGBuilder took 335.77ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 61.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:45,883 INFO L158 Benchmark]: BuchiAutomizer took 2623.78ms. Allocated memory was 109.1MB in the beginning and 144.7MB in the end (delta: 35.7MB). Free memory was 61.0MB in the beginning and 75.8MB in the end (delta: -14.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-02-21 03:34:45,885 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.10ms. Allocated memory is still 109.1MB. Free memory was 80.5MB in the beginning and 76.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.77ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.77ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 61.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2623.78ms. Allocated memory was 109.1MB in the beginning and 144.7MB in the end (delta: 35.7MB). Free memory was 61.0MB in the beginning and 75.8MB in the end (delta: -14.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:34:45,918 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!