./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-memory-alloca/Urban-2013WST-Fig2-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 b6ea490b9c20ea87d0996e916d918afb3a914616 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:16:00,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:16:00,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:16:00,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:16:00,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:16:00,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:16:00,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:16:00,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:16:00,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:16:00,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:16:00,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:16:00,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:16:00,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:16:00,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:16:00,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:16:00,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:16:00,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:16:00,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:16:00,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:16:00,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:16:00,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:16:00,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:16:00,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:16:00,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:16:00,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:16:00,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:16:00,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:16:00,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:16:00,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:16:00,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:16:00,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:16:00,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:16:00,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:16:00,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:16:00,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:16:00,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:16:00,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:16:00,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:16:00,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:16:00,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:16:00,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:16:00,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:16:00,794 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:16:00,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:16:00,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:16:00,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:16:00,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:16:00,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:16:00,798 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:16:00,798 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:16:00,798 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:16:00,798 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:16:00,798 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:16:00,799 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:16:00,799 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:16:00,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:16:00,799 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:16:00,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:16:00,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:16:00,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:16:00,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:16:00,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:16:00,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:16:00,801 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:16:00,801 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:16:00,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:16:00,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:16:00,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:16:00,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:16:00,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:16:00,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:16:00,803 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:16:00,803 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 -> b6ea490b9c20ea87d0996e916d918afb3a914616 [2021-08-27 14:16:01,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:16:01,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:16:01,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:16:01,079 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:16:01,079 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:16:01,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2021-08-27 14:16:01,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571851873/07b903de28884a6391d029abfa2e2c81/FLAGac53a3885 [2021-08-27 14:16:01,502 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:16:01,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2021-08-27 14:16:01,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571851873/07b903de28884a6391d029abfa2e2c81/FLAGac53a3885 [2021-08-27 14:16:01,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571851873/07b903de28884a6391d029abfa2e2c81 [2021-08-27 14:16:01,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:16:01,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:16:01,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:16:01,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:16:01,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:16:01,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f419c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01, skipping insertion in model container [2021-08-27 14:16:01,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:16:01,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:16:01,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:16:01,811 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:16:01,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:16:01,867 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:16:01,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01 WrapperNode [2021-08-27 14:16:01,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:16:01,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:16:01,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:16:01,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:16:01,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:16:01,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:16:01,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:16:01,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:16:01,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:16:01,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:16:01,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:16:01,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:16:01,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (1/1) ... [2021-08-27 14:16:01,930 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:01,952 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) [2021-08-27 14:16:01,955 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 [2021-08-27 14:16:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:16:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:16:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:16:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:16:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:16:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:16:02,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:16:02,165 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-27 14:16:02,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:16:02 BoogieIcfgContainer [2021-08-27 14:16:02,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:16:02,167 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:16:02,167 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:16:02,169 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:16:02,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:16:02,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:16:01" (1/3) ... [2021-08-27 14:16:02,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@580d0a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:16:02, skipping insertion in model container [2021-08-27 14:16:02,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:16:02,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:16:01" (2/3) ... [2021-08-27 14:16:02,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@580d0a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:16:02, skipping insertion in model container [2021-08-27 14:16:02,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:16:02,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:16:02" (3/3) ... [2021-08-27 14:16:02,171 INFO L389 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2021-08-27 14:16:02,224 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:16:02,224 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:16:02,224 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:16:02,224 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:16:02,224 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:16:02,224 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:16:02,224 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:16:02,224 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:16:02,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2021-08-27 14:16:02,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:16:02,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:02,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:02,282 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:02,282 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:16:02,282 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:16:02,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2021-08-27 14:16:02,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:16:02,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:02,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:02,284 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:02,284 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:16:02,288 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 7#L549-3true [2021-08-27 14:16:02,288 INFO L793 eck$LassoCheckResult]: Loop: 7#L549-3true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 3#L549-1true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 8#L551-3true assume !true; 12#L551-4true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 7#L549-3true [2021-08-27 14:16:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:16:02,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:02,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119187369] [2021-08-27 14:16:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:02,390 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:02,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2021-08-27 14:16:02,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:02,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237580903] [2021-08-27 14:16:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:02,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:02,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237580903] [2021-08-27 14:16:02,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237580903] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:16:02,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:16:02,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 14:16:02,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672396895] [2021-08-27 14:16:02,479 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:02,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:02,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 14:16:02,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 14:16:02,495 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:16:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:02,499 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-08-27 14:16:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 14:16:02,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-08-27 14:16:02,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:16:02,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2021-08-27 14:16:02,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 14:16:02,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 14:16:02,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2021-08-27 14:16:02,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:02,504 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-08-27 14:16:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2021-08-27 14:16:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-08-27 14:16:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:16:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-08-27 14:16:02,521 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-08-27 14:16:02,521 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-08-27 14:16:02,521 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:16:02,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-08-27 14:16:02,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:16:02,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:02,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:02,522 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:02,522 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:16:02,522 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 33#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 34#L549-3 [2021-08-27 14:16:02,522 INFO L793 eck$LassoCheckResult]: Loop: 34#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 30#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 31#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 35#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 36#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 34#L549-3 [2021-08-27 14:16:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:16:02,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:02,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899085658] [2021-08-27 14:16:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:02,560 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:02,567 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2021-08-27 14:16:02,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:02,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307279555] [2021-08-27 14:16:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:02,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:02,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307279555] [2021-08-27 14:16:02,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307279555] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:16:02,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:16:02,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:16:02,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039597990] [2021-08-27 14:16:02,705 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:02,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:16:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:16:02,706 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2021-08-27 14:16:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:02,740 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-08-27 14:16:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:16:02,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2021-08-27 14:16:02,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 14:16:02,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2021-08-27 14:16:02,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-27 14:16:02,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-08-27 14:16:02,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-08-27 14:16:02,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:02,747 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 14:16:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-08-27 14:16:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-27 14:16:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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) [2021-08-27 14:16:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-08-27 14:16:02,748 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 14:16:02,748 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 14:16:02,748 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:16:02,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-08-27 14:16:02,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-27 14:16:02,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:02,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:02,749 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:02,749 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2021-08-27 14:16:02,749 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 58#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 59#L549-3 [2021-08-27 14:16:02,749 INFO L793 eck$LassoCheckResult]: Loop: 59#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 55#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 56#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 60#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 61#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 63#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 62#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 59#L549-3 [2021-08-27 14:16:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:16:02,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:02,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471369990] [2021-08-27 14:16:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:02,759 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:02,767 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2021-08-27 14:16:02,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:02,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307482736] [2021-08-27 14:16:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:02,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:02,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307482736] [2021-08-27 14:16:02,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307482736] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:02,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422157709] [2021-08-27 14:16:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:02,813 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:02,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:02,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 14:16:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:02,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:16:02,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:02,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:03,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:03,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:03,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422157709] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:03,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:03,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-08-27 14:16:03,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087343491] [2021-08-27 14:16:03,074 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:03,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:16:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:16:03,076 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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) [2021-08-27 14:16:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:03,133 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-08-27 14:16:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:16:03,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-08-27 14:16:03,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-27 14:16:03,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-08-27 14:16:03,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:16:03,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:16:03,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-08-27 14:16:03,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:03,136 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 14:16:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-08-27 14:16:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-08-27 14:16:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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) [2021-08-27 14:16:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-08-27 14:16:03,138 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 14:16:03,138 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 14:16:03,138 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:16:03,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-08-27 14:16:03,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-27 14:16:03,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:03,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:03,140 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:03,140 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2021-08-27 14:16:03,140 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 108#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 109#L549-3 [2021-08-27 14:16:03,141 INFO L793 eck$LassoCheckResult]: Loop: 109#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 105#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 106#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 110#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 111#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 115#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 114#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 113#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 112#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 109#L549-3 [2021-08-27 14:16:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:16:03,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:03,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329512223] [2021-08-27 14:16:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:03,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:03,155 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:03,168 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1970998361, now seen corresponding path program 2 times [2021-08-27 14:16:03,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:03,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927084344] [2021-08-27 14:16:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:03,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:03,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:03,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927084344] [2021-08-27 14:16:03,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927084344] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:03,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621554784] [2021-08-27 14:16:03,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:16:03,314 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:03,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:03,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 14:16:03,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:16:03,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:03,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:16:03,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:03,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:03,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:03,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:03,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:03,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621554784] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:03,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:03,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2021-08-27 14:16:03,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961453519] [2021-08-27 14:16:03,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:03,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:03,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:16:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:16:03,542 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2021-08-27 14:16:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:03,617 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-08-27 14:16:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 14:16:03,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-08-27 14:16:03,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-08-27 14:16:03,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2021-08-27 14:16:03,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-08-27 14:16:03,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-08-27 14:16:03,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2021-08-27 14:16:03,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:03,621 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 14:16:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2021-08-27 14:16:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-08-27 14:16:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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) [2021-08-27 14:16:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-27 14:16:03,623 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 14:16:03,624 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 14:16:03,624 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:16:03,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2021-08-27 14:16:03,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-08-27 14:16:03,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:03,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:03,626 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:03,626 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2021-08-27 14:16:03,626 INFO L791 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 173#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L549-3 [2021-08-27 14:16:03,626 INFO L793 eck$LassoCheckResult]: Loop: 174#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 170#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 171#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 182#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 181#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 180#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 179#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 178#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 174#L549-3 [2021-08-27 14:16:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:16:03,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:03,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804960392] [2021-08-27 14:16:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:03,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:03,646 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:03,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -48795806, now seen corresponding path program 3 times [2021-08-27 14:16:03,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:03,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28078990] [2021-08-27 14:16:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:03,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:03,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:03,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28078990] [2021-08-27 14:16:03,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28078990] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:03,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267991584] [2021-08-27 14:16:03,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:16:03,780 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:03,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:03,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 14:16:03,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 14:16:03,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:03,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:16:03,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:03,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:03,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:03,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:03,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:03,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:03,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267991584] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:03,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:03,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2021-08-27 14:16:03,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132095629] [2021-08-27 14:16:03,976 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:03,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:03,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 14:16:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-27 14:16:03,977 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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) [2021-08-27 14:16:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:04,087 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-08-27 14:16:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 14:16:04,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2021-08-27 14:16:04,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:16:04,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2021-08-27 14:16:04,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-08-27 14:16:04,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-08-27 14:16:04,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2021-08-27 14:16:04,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:04,090 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 14:16:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2021-08-27 14:16:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-08-27 14:16:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 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) [2021-08-27 14:16:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-08-27 14:16:04,091 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 14:16:04,091 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 14:16:04,091 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:16:04,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-08-27 14:16:04,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:16:04,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:04,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:04,092 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:04,092 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2021-08-27 14:16:04,093 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 254#L549-3 [2021-08-27 14:16:04,093 INFO L793 eck$LassoCheckResult]: Loop: 254#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 250#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 251#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 257#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 255#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 256#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 264#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 263#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 262#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 261#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 260#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 259#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 258#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 254#L549-3 [2021-08-27 14:16:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:16:04,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:04,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795639648] [2021-08-27 14:16:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:04,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:04,121 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:04,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 4 times [2021-08-27 14:16:04,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:04,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510606949] [2021-08-27 14:16:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:04,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:04,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:04,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510606949] [2021-08-27 14:16:04,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510606949] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:04,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177721087] [2021-08-27 14:16:04,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:16:04,329 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:04,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:04,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 14:16:04,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:16:04,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:04,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:16:04,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:04,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:04,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:04,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:04,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:04,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:04,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:04,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177721087] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:04,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:04,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2021-08-27 14:16:04,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499401120] [2021-08-27 14:16:04,591 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:04,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:04,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 14:16:04,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-08-27 14:16:04,592 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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) [2021-08-27 14:16:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:04,860 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2021-08-27 14:16:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 14:16:04,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2021-08-27 14:16:04,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-08-27 14:16:04,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2021-08-27 14:16:04,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 14:16:04,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 14:16:04,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2021-08-27 14:16:04,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:04,861 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:16:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2021-08-27 14:16:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-08-27 14:16:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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) [2021-08-27 14:16:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-08-27 14:16:04,862 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:16:04,862 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:16:04,863 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:16:04,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2021-08-27 14:16:04,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-08-27 14:16:04,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:04,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:04,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:04,863 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2021-08-27 14:16:04,863 INFO L791 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 348#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 349#L549-3 [2021-08-27 14:16:04,863 INFO L793 eck$LassoCheckResult]: Loop: 349#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 345#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 346#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 352#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 350#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 351#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 361#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 360#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 359#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 358#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 357#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 356#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 355#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 354#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 353#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 349#L549-3 [2021-08-27 14:16:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:16:04,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:04,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383628710] [2021-08-27 14:16:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:04,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:04,867 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:04,897 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:04,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:04,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1105064296, now seen corresponding path program 5 times [2021-08-27 14:16:04,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:04,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158617217] [2021-08-27 14:16:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:04,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:05,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:05,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158617217] [2021-08-27 14:16:05,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158617217] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:05,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643996670] [2021-08-27 14:16:05,122 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:16:05,122 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:05,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:05,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:05,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 14:16:05,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 14:16:05,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:05,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:16:05,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:05,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:05,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:05,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:05,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:05,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:05,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:05,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:05,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643996670] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:05,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:05,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2021-08-27 14:16:05,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168606710] [2021-08-27 14:16:05,504 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:05,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 14:16:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-08-27 14:16:05,505 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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) [2021-08-27 14:16:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:05,742 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-08-27 14:16:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:16:05,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2021-08-27 14:16:05,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-08-27 14:16:05,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 14:16:05,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 14:16:05,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 14:16:05,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2021-08-27 14:16:05,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:05,744 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:16:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2021-08-27 14:16:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-08-27 14:16:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 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) [2021-08-27 14:16:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 14:16:05,745 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:16:05,745 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:16:05,745 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:16:05,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-08-27 14:16:05,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-08-27 14:16:05,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:05,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:05,746 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:05,746 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2021-08-27 14:16:05,746 INFO L791 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 458#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 459#L549-3 [2021-08-27 14:16:05,746 INFO L793 eck$LassoCheckResult]: Loop: 459#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 455#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 456#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 462#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 460#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 461#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 473#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 472#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 471#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 470#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 469#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 468#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 467#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 466#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 465#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 464#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 463#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 459#L549-3 [2021-08-27 14:16:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:16:05,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:05,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691132624] [2021-08-27 14:16:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:05,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:05,758 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:05,761 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1109814765, now seen corresponding path program 6 times [2021-08-27 14:16:05,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:05,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423423761] [2021-08-27 14:16:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:05,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:06,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:06,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423423761] [2021-08-27 14:16:06,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423423761] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:06,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175491396] [2021-08-27 14:16:06,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:16:06,010 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:06,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:06,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 14:16:06,150 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 14:16:06,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:06,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:16:06,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:06,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:06,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:06,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:06,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:07,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:07,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:07,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:07,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:07,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175491396] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:07,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:07,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2021-08-27 14:16:07,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469566074] [2021-08-27 14:16:07,883 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:07,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 14:16:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-08-27 14:16:07,884 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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) [2021-08-27 14:16:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:08,914 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-08-27 14:16:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 14:16:08,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2021-08-27 14:16:08,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2021-08-27 14:16:08,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2021-08-27 14:16:08,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-08-27 14:16:08,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-08-27 14:16:08,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2021-08-27 14:16:08,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:08,916 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 14:16:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2021-08-27 14:16:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-08-27 14:16:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 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) [2021-08-27 14:16:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-08-27 14:16:08,917 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 14:16:08,917 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 14:16:08,917 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:16:08,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2021-08-27 14:16:08,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2021-08-27 14:16:08,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:08,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:08,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:08,918 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2021-08-27 14:16:08,918 INFO L791 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 583#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 584#L549-3 [2021-08-27 14:16:08,918 INFO L793 eck$LassoCheckResult]: Loop: 584#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 580#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 581#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 585#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 586#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 587#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 600#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 599#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 598#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 597#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 596#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 595#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 594#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 593#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 592#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 591#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 590#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 589#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 588#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 584#L549-3 [2021-08-27 14:16:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:08,918 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 14:16:08,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:08,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45440563] [2021-08-27 14:16:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:08,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:08,932 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:08,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1380048178, now seen corresponding path program 7 times [2021-08-27 14:16:08,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:08,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584004349] [2021-08-27 14:16:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:08,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:09,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:09,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584004349] [2021-08-27 14:16:09,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584004349] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:09,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246304867] [2021-08-27 14:16:09,181 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:16:09,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:09,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:09,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 14:16:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:09,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:16:09,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:09,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:09,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:09,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:09,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:10,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:10,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:10,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:10,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:10,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:10,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246304867] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:10,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:10,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2021-08-27 14:16:10,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483369731] [2021-08-27 14:16:10,176 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:10,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 14:16:10,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-08-27 14:16:10,179 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2021-08-27 14:16:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:11,319 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-08-27 14:16:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 14:16:11,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-08-27 14:16:11,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-08-27 14:16:11,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-08-27 14:16:11,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 14:16:11,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 14:16:11,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-08-27 14:16:11,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:11,324 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:16:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-08-27 14:16:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-08-27 14:16:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 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) [2021-08-27 14:16:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-08-27 14:16:11,329 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:16:11,329 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:16:11,329 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:16:11,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2021-08-27 14:16:11,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-08-27 14:16:11,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:11,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:11,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:11,332 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2021-08-27 14:16:11,332 INFO L791 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 723#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 724#L549-3 [2021-08-27 14:16:11,332 INFO L793 eck$LassoCheckResult]: Loop: 724#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 720#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 721#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 725#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 726#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 727#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 742#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 741#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 740#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 739#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 738#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 737#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 736#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 735#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 734#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 733#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 732#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 731#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 730#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 729#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 728#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 724#L549-3 [2021-08-27 14:16:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-27 14:16:11,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:11,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178104080] [2021-08-27 14:16:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:11,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:11,356 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:11,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash 918646985, now seen corresponding path program 8 times [2021-08-27 14:16:11,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:11,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683422118] [2021-08-27 14:16:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:11,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:11,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:11,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683422118] [2021-08-27 14:16:11,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683422118] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:11,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847149449] [2021-08-27 14:16:11,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:16:11,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:11,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:11,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:11,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 14:16:11,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:16:11,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:11,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 14:16:11,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:11,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:11,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:11,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:12,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:12,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847149449] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:12,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:12,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 28 [2021-08-27 14:16:12,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905603919] [2021-08-27 14:16:12,222 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:12,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 14:16:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2021-08-27 14:16:12,223 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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) [2021-08-27 14:16:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:12,709 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-08-27 14:16:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 14:16:12,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2021-08-27 14:16:12,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-27 14:16:12,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 14:16:12,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-27 14:16:12,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-27 14:16:12,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2021-08-27 14:16:12,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:12,710 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:16:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2021-08-27 14:16:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-08-27 14:16:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 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) [2021-08-27 14:16:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 14:16:12,711 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:16:12,711 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:16:12,711 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:16:12,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-08-27 14:16:12,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-27 14:16:12,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:12,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:12,712 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:16:12,712 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2021-08-27 14:16:12,712 INFO L791 eck$LassoCheckResult]: Stem: 877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 878#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 879#L549-3 [2021-08-27 14:16:12,712 INFO L793 eck$LassoCheckResult]: Loop: 879#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 875#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 876#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 882#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 880#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 881#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 899#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 898#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 897#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 896#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 895#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 894#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 893#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 892#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 891#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 890#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 889#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 888#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 887#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 886#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 885#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 884#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 883#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 879#L549-3 [2021-08-27 14:16:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-08-27 14:16:12,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:12,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313710650] [2021-08-27 14:16:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:12,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:12,719 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:12,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:12,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:12,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 9 times [2021-08-27 14:16:12,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:12,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745007834] [2021-08-27 14:16:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:12,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:12,745 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:12,773 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2021-08-27 14:16:12,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:12,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658509968] [2021-08-27 14:16:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:12,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:12,814 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:12,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:16,416 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:16:16,416 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:16:16,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:16:16,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:16:16,417 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:16:16,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:16,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:16:16,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:16:16,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration11_Lasso [2021-08-27 14:16:16,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:16:16,417 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:16:16,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:16:16,961 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:16:16,975 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:16:16,979 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:16,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:16,980 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) [2021-08-27 14:16:16,981 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 [2021-08-27 14:16:16,984 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 [2021-08-27 14:16:16,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:16,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:16,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:16,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:16,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:16,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:16,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:17,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,030 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 [2021-08-27 14:16:17,030 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,031 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) [2021-08-27 14:16:17,036 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 [2021-08-27 14:16:17,037 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 [2021-08-27 14:16:17,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:17,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:17,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:17,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,075 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 [2021-08-27 14:16:17,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,076 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) [2021-08-27 14:16:17,082 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 [2021-08-27 14:16:17,084 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 [2021-08-27 14:16:17,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:16:17,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:16:17,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,149 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 [2021-08-27 14:16:17,149 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,150 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:17,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:16:17,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:16:17,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:16:17,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:16:17,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:17,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,222 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:17,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:16:17,232 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 [2021-08-27 14:16:17,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:16:17,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:16:17,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-08-27 14:16:17,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,388 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:17,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:16:17,512 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 [2021-08-27 14:16:17,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:16:17,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:16:17,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-08-27 14:16:17,637 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,643 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:17,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 14:16:17,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:16:17,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:17,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:17,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:17,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:16:17,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:17,754 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,755 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:17,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 14:16:17,769 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 [2021-08-27 14:16:17,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:16:17,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:16:17,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:16:17,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:16:17,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:16:17,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:16:17,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:16:17,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:16:17,826 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 14:16:17,826 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 14:16:17,827 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:16:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:17,835 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:16:17,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 14:16:17,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:16:17,857 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 14:16:17,857 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:16:17,857 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] [2021-08-27 14:16:17,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:17,988 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 14:16:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:18,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:16:18,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:18,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 14:16:18,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:18,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-08-27 14:16:18,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-08-27 14:16:18,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:18,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 14:16:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:19,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2021-08-27 14:16:19,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) [2021-08-27 14:16:19,379 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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 57 states and 62 transitions. Complement of second has 26 states. [2021-08-27 14:16:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2021-08-27 14:16:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) [2021-08-27 14:16:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2021-08-27 14:16:19,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 23 letters. [2021-08-27 14:16:19,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:16:19,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 25 letters. Loop has 23 letters. [2021-08-27 14:16:19,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:16:19,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 46 letters. [2021-08-27 14:16:19,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:16:19,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2021-08-27 14:16:19,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-08-27 14:16:19,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 61 transitions. [2021-08-27 14:16:19,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 14:16:19,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 14:16:19,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2021-08-27 14:16:19,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:16:19,399 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-08-27 14:16:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2021-08-27 14:16:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-08-27 14:16:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 54 states have internal predecessors, (60), 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) [2021-08-27 14:16:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2021-08-27 14:16:19,405 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-08-27 14:16:19,405 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-08-27 14:16:19,405 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:16:19,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2021-08-27 14:16:19,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-08-27 14:16:19,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:16:19,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:16:19,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-27 14:16:19,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2021-08-27 14:16:19,408 INFO L791 eck$LassoCheckResult]: Stem: 1148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1149#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1158#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1144#L549-1 [2021-08-27 14:16:19,409 INFO L793 eck$LassoCheckResult]: Loop: 1144#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1145#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1156#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1152#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1153#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1178#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1174#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1173#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1172#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1169#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1168#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1167#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1166#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1165#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1164#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1163#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1162#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1161#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1159#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1150#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1144#L549-1 [2021-08-27 14:16:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-08-27 14:16:19,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:19,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240790664] [2021-08-27 14:16:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:19,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:19,423 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:16:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:16:19,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:16:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:16:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1726515181, now seen corresponding path program 10 times [2021-08-27 14:16:19,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:16:19,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623965039] [2021-08-27 14:16:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:16:19,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:16:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:16:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:19,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:16:19,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623965039] [2021-08-27 14:16:19,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623965039] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:19,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717582064] [2021-08-27 14:16:19,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:16:19,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:16:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:16:19,994 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:16:19,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 14:16:20,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:16:20,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:16:20,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:16:20,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:16:20,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 14:16:20,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:20,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:20,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:20,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:20,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:20,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:20,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:21,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:21,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:16:21,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 14:16:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:16:21,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717582064] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:16:21,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:16:21,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2021-08-27 14:16:21,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201116516] [2021-08-27 14:16:21,278 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:16:21,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:16:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-27 14:16:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2021-08-27 14:16:21,280 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 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) [2021-08-27 14:16:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:16:21,568 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2021-08-27 14:16:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 14:16:21,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2021-08-27 14:16:21,570 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:16:21,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2021-08-27 14:16:21,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 14:16:21,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 14:16:21,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 14:16:21,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:16:21,570 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:16:21,570 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:16:21,570 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:16:21,571 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:16:21,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 14:16:21,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:16:21,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 14:16:21,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:16:21 BoogieIcfgContainer [2021-08-27 14:16:21,575 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:16:21,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:16:21,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:16:21,575 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:16:21,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:16:02" (3/4) ... [2021-08-27 14:16:21,578 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 14:16:21,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:16:21,579 INFO L168 Benchmark]: Toolchain (without parser) took 20048.56 ms. Allocated memory was 52.4 MB in the beginning and 157.3 MB in the end (delta: 104.9 MB). Free memory was 28.5 MB in the beginning and 49.5 MB in the end (delta: -21.0 MB). Peak memory consumption was 83.3 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:21,579 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 52.4 MB. Free memory was 34.5 MB in the beginning and 34.4 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:16:21,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.79 ms. Allocated memory is still 52.4 MB. Free memory was 28.3 MB in the beginning and 30.4 MB in the end (delta: -2.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:21,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.82 ms. Allocated memory is still 52.4 MB. Free memory was 30.4 MB in the beginning and 28.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:16:21,580 INFO L168 Benchmark]: Boogie Preprocessor took 20.93 ms. Allocated memory is still 52.4 MB. Free memory was 28.8 MB in the beginning and 27.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:21,580 INFO L168 Benchmark]: RCFGBuilder took 243.09 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 27.6 MB in the beginning and 35.5 MB in the end (delta: -7.9 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:21,580 INFO L168 Benchmark]: BuchiAutomizer took 19407.90 ms. Allocated memory was 62.9 MB in the beginning and 157.3 MB in the end (delta: 94.4 MB). Free memory was 35.3 MB in the beginning and 49.5 MB in the end (delta: -14.2 MB). Peak memory consumption was 79.8 MB. Max. memory is 16.1 GB. [2021-08-27 14:16:21,580 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 157.3 MB. Free memory is still 49.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:16:21,597 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 52.4 MB. Free memory was 34.5 MB in the beginning and 34.4 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 335.79 ms. Allocated memory is still 52.4 MB. Free memory was 28.3 MB in the beginning and 30.4 MB in the end (delta: -2.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.82 ms. Allocated memory is still 52.4 MB. Free memory was 30.4 MB in the beginning and 28.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.93 ms. Allocated memory is still 52.4 MB. Free memory was 28.8 MB in the beginning and 27.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 243.09 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 27.6 MB in the beginning and 35.5 MB in the end (delta: -7.9 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 19407.90 ms. Allocated memory was 62.9 MB in the beginning and 157.3 MB in the end (delta: 94.4 MB). Free memory was 35.3 MB in the beginning and 49.5 MB in the end (delta: -14.2 MB). Peak memory consumption was 79.8 MB. Max. memory is 16.1 GB. * Witness Printer took 3.13 ms. Allocated memory is still 157.3 MB. Free memory is still 49.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 21 + -2 * unknown-#memory_int-unknown[x1][x1] and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.3s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 14.0s. Construction of modules took 1.7s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 30.3ms AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/90 HoareTripleCheckerStatistics: 73 SDtfs, 115 SDslu, 123 SDs, 0 SdLazy, 1381 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1735.7ms Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax111 hnf100 lsp85 ukn72 mio100 lsp44 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 14:16:21,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:21,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:22,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:22,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:22,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:22,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:22,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:23,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:23,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 14:16:23,438 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...