./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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/array-industry-pattern/array_assert_loop_dep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash e71cee6f8bfbdef490f31ccfbc80e5cb950e3b6d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 01:52:56,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 01:52:56,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 01:52:56,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 01:52:56,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 01:52:56,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 01:52:56,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 01:52:56,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 01:52:56,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 01:52:56,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 01:52:56,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 01:52:56,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 01:52:56,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 01:52:56,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 01:52:56,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 01:52:56,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 01:52:56,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 01:52:56,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 01:52:56,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 01:52:56,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 01:52:56,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 01:52:56,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 01:52:56,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 01:52:56,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 01:52:56,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 01:52:56,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 01:52:56,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 01:52:56,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 01:52:56,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 01:52:56,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 01:52:56,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 01:52:56,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 01:52:56,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 01:52:56,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 01:52:56,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 01:52:56,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 01:52:56,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 01:52:56,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 01:52:56,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 01:52:56,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 01:52:56,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 01:52:56,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 01:52:56,856 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 01:52:56,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 01:52:56,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 01:52:56,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 01:52:56,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 01:52:56,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 01:52:56,857 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 01:52:56,858 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 01:52:56,858 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 01:52:56,858 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 01:52:56,858 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 01:52:56,858 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 01:52:56,860 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 01:52:56,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 01:52:56,861 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 01:52:56,861 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 01:52:56,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 01:52:56,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 01:52:56,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 01:52:56,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 01:52:56,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 01:52:56,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 01:52:56,862 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 01:52:56,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 01:52:56,863 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 01:52:56,863 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 01:52:56,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 01:52:56,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 01:52:56,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 01:52:56,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 01:52:56,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 01:52:56,864 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 01:52:56,866 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 01:52:56,866 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e71cee6f8bfbdef490f31ccfbc80e5cb950e3b6d [2021-08-31 01:52:57,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 01:52:57,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 01:52:57,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 01:52:57,186 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 01:52:57,186 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 01:52:57,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2021-08-31 01:52:57,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495e832b6/94918160af394f4b9742981241fc040c/FLAG60b7287c6 [2021-08-31 01:52:57,633 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 01:52:57,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2021-08-31 01:52:57,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495e832b6/94918160af394f4b9742981241fc040c/FLAG60b7287c6 [2021-08-31 01:52:58,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495e832b6/94918160af394f4b9742981241fc040c [2021-08-31 01:52:58,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 01:52:58,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 01:52:58,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 01:52:58,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 01:52:58,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 01:52:58,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f26533d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58, skipping insertion in model container [2021-08-31 01:52:58,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 01:52:58,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 01:52:58,168 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2021-08-31 01:52:58,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:52:58,184 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 01:52:58,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2021-08-31 01:52:58,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:52:58,237 INFO L208 MainTranslator]: Completed translation [2021-08-31 01:52:58,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58 WrapperNode [2021-08-31 01:52:58,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 01:52:58,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 01:52:58,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 01:52:58,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 01:52:58,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 01:52:58,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 01:52:58,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 01:52:58,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 01:52:58,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 01:52:58,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 01:52:58,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 01:52:58,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 01:52:58,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (1/1) ... [2021-08-31 01:52:58,327 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:52:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:52:58,350 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-31 01:52:58,373 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-31 01:52:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 01:52:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 01:52:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 01:52:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 01:52:58,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 01:52:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 01:52:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 01:52:58,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 01:52:58,533 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-31 01:52:58,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:52:58 BoogieIcfgContainer [2021-08-31 01:52:58,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 01:52:58,536 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 01:52:58,536 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 01:52:58,541 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 01:52:58,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:52:58,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 01:52:58" (1/3) ... [2021-08-31 01:52:58,543 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d33cd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:52:58, skipping insertion in model container [2021-08-31 01:52:58,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:52:58,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:52:58" (2/3) ... [2021-08-31 01:52:58,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d33cd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:52:58, skipping insertion in model container [2021-08-31 01:52:58,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:52:58,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:52:58" (3/3) ... [2021-08-31 01:52:58,546 INFO L389 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2021-08-31 01:52:58,598 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 01:52:58,598 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 01:52:58,600 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 01:52:58,601 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 01:52:58,601 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 01:52:58,601 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 01:52:58,601 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 01:52:58,601 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 01:52:58,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:52:58,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-31 01:52:58,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:52:58,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:52:58,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 01:52:58,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:52:58,627 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 01:52:58,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:52:58,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-31 01:52:58,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:52:58,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:52:58,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 01:52:58,629 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:52:58,636 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 8#L-1true havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 13#L18-3true [2021-08-31 01:52:58,637 INFO L793 eck$LassoCheckResult]: Loop: 13#L18-3true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 12#L18-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 13#L18-3true [2021-08-31 01:52:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:52:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 01:52:58,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:52:58,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335882540] [2021-08-31 01:52:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:52:58,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:52:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:52:58,749 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:52:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:52:58,792 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:52:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:52:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-31 01:52:58,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:52:58,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449204002] [2021-08-31 01:52:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:52:58,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:52:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:52:58,816 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:52:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:52:58,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:52:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:52:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-31 01:52:58,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:52:58,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339712658] [2021-08-31 01:52:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:52:58,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:52:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:52:58,857 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:52:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:52:58,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:52:59,371 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:52:59,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:52:59,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:52:59,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:52:59,373 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:52:59,373 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:52:59,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:52:59,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:52:59,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2021-08-31 01:52:59,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:52:59,374 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:52:59,388 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-31 01:52:59,392 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-31 01:52:59,394 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-31 01:52:59,397 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-31 01:52:59,400 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-31 01:52:59,402 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-31 01:52:59,404 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-31 01:52:59,407 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-31 01:52:59,791 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:52:59,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:52:59,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:52:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:52:59,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:52:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 01:52:59,816 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-31 01:52:59,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:52:59,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:52:59,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:52:59,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:52:59,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:52:59,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:52:59,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:52:59,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:52:59,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-31 01:52:59,866 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:52:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:52:59,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:52:59,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 01:52:59,870 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-31 01:52:59,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:52:59,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:52:59,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:52:59,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:52:59,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:52:59,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:52:59,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:52:59,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:52:59,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-31 01:52:59,902 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:52:59,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:52:59,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:52:59,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 01:52:59,906 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-31 01:52:59,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:52:59,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:52:59,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:52:59,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:52:59,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:52:59,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:52:59,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:52:59,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 01:52:59,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:52:59,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:52:59,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:52:59,983 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-31 01:52:59,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:52:59,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:52:59,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:52:59,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:52:59,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:52:59,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:52:59,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:52:59,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 01:52:59,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:00,018 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:53:00,024 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-31 01:53:00,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-31 01:53:00,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:53:00,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:53:00,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:53:00,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:00,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:53:00,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-31 01:53:00,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:53:00,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:00,124 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:53:00,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-31 01:53:00,127 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-31 01:53:00,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:00,188 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:53:00,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 01:53:00,191 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-31 01:53:00,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:00,230 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,230 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-31 01:53:00,231 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-31 01:53:00,233 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-31 01:53:00,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,288 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-31 01:53:00,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,289 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-31 01:53:00,305 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-31 01:53:00,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:53:00,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:53:00,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:53:00,317 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-31 01:53:00,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,353 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-31 01:53:00,353 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,355 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-31 01:53:00,357 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-31 01:53:00,358 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-31 01:53:00,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,410 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-31 01:53:00,410 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,415 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-31 01:53:00,416 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-31 01:53:00,418 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-31 01:53:00,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:53:00,467 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-31 01:53:00,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,468 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-31 01:53:00,468 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-31 01:53:00,470 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-31 01:53:00,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:53:00,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:53:00,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:53:00,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:53:00,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:53:00,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:53:00,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:53:00,548 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-31 01:53:00,549 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-31 01:53:00,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:53:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:00,583 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-31 01:53:00,638 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-31 01:53:00,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:53:00,648 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 01:53:00,648 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:53:00,649 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~i~0 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2021-08-31 01:53:00,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:00,687 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-31 01:53:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:00,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:53:00,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:53:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:00,740 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 01:53:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:53:00,791 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-31 01:53:00,821 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 01:53:00,822 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-31 01:53:00,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 41 transitions. Complement of second has 8 states. [2021-08-31 01:53:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 01:53:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-31 01:53:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2021-08-31 01:53:00,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-31 01:53:00,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:53:00,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-31 01:53:00,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:53:00,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-31 01:53:00,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:53:00,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2021-08-31 01:53:00,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-31 01:53:00,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2021-08-31 01:53:00,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-31 01:53:00,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-31 01:53:00,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-08-31 01:53:00,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:53:00,886 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-31 01:53:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-08-31 01:53:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-08-31 01:53:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-31 01:53:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-08-31 01:53:00,906 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-31 01:53:00,906 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-31 01:53:00,906 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 01:53:00,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-08-31 01:53:00,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-31 01:53:00,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:53:00,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:53:00,908 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 01:53:00,908 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 01:53:00,908 INFO L791 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 115#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 121#L18-3 assume !(main_~i~0 < 100000); 119#L18-4 main_~i~0 := 0; 120#L22-3 [2021-08-31 01:53:00,909 INFO L793 eck$LassoCheckResult]: Loop: 120#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 116#L13 assume !(0 == __VERIFIER_assert_~cond); 113#L13-3 havoc main_#t~mem5; 122#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 123#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 120#L22-3 [2021-08-31 01:53:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-31 01:53:00,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:00,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266692223] [2021-08-31 01:53:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:00,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:00,959 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-31 01:53:00,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:53:00,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266692223] [2021-08-31 01:53:00,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266692223] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:53:00,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:53:00,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 01:53:00,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502755894] [2021-08-31 01:53:00,963 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:53:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2021-08-31 01:53:00,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:00,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555216359] [2021-08-31 01:53:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:00,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:00,972 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:53:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:00,979 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:53:01,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:53:01,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:53:01,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:53:01,088 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-31 01:53:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:53:01,122 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-08-31 01:53:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:53:01,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-08-31 01:53:01,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 01:53:01,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2021-08-31 01:53:01,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-08-31 01:53:01,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-08-31 01:53:01,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-08-31 01:53:01,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:53:01,128 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-31 01:53:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-08-31 01:53:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-08-31 01:53:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 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-31 01:53:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-08-31 01:53:01,132 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-31 01:53:01,133 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-31 01:53:01,133 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 01:53:01,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2021-08-31 01:53:01,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 01:53:01,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:53:01,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:53:01,138 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 01:53:01,138 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 01:53:01,138 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 150#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 155#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 153#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 154#L18-3 assume !(main_~i~0 < 100000); 156#L18-4 main_~i~0 := 0; 157#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 163#L13 assume !(0 == __VERIFIER_assert_~cond); 162#L13-3 havoc main_#t~mem5; 158#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 159#L22-2 [2021-08-31 01:53:01,138 INFO L793 eck$LassoCheckResult]: Loop: 159#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 161#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 151#L13 assume !(0 == __VERIFIER_assert_~cond); 152#L13-3 havoc main_#t~mem5; 160#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 159#L22-2 [2021-08-31 01:53:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:01,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2021-08-31 01:53:01,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:01,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325690720] [2021-08-31 01:53:01,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:01,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:53:01,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:53:01,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325690720] [2021-08-31 01:53:01,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325690720] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:53:01,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132424679] [2021-08-31 01:53:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:01,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:53:01,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:01,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:53:01,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-31 01:53:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:01,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 01:53:01,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:53:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:53:01,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:53:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:53:01,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132424679] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:53:01,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:53:01,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-08-31 01:53:01,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121171734] [2021-08-31 01:53:01,266 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:53:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2021-08-31 01:53:01,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:01,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339685150] [2021-08-31 01:53:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:01,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:01,273 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:53:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:01,280 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:53:01,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:01,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:53:01,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:53:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:53:01,428 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-31 01:53:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:53:01,489 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-08-31 01:53:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 01:53:01,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2021-08-31 01:53:01,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-31 01:53:01,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2021-08-31 01:53:01,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-31 01:53:01,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 01:53:01,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2021-08-31 01:53:01,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:53:01,492 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-08-31 01:53:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2021-08-31 01:53:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2021-08-31 01:53:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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-31 01:53:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-08-31 01:53:01,494 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-31 01:53:01,495 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-31 01:53:01,495 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 01:53:01,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2021-08-31 01:53:01,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 01:53:01,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:53:01,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:53:01,496 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-08-31 01:53:01,496 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 01:53:01,496 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 264#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 267#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 268#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 269#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 265#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 266#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 279#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 278#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 277#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 276#L18-3 assume !(main_~i~0 < 100000); 270#L18-4 main_~i~0 := 0; 271#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 282#L13 assume !(0 == __VERIFIER_assert_~cond); 280#L13-3 havoc main_#t~mem5; 281#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 283#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 284#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 286#L13 assume !(0 == __VERIFIER_assert_~cond); 285#L13-3 havoc main_#t~mem5; 272#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 273#L22-2 [2021-08-31 01:53:01,496 INFO L793 eck$LassoCheckResult]: Loop: 273#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 275#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 261#L13 assume !(0 == __VERIFIER_assert_~cond); 262#L13-3 havoc main_#t~mem5; 274#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 273#L22-2 [2021-08-31 01:53:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1930352971, now seen corresponding path program 1 times [2021-08-31 01:53:01,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:01,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256456814] [2021-08-31 01:53:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:01,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 01:53:01,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:53:01,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256456814] [2021-08-31 01:53:01,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256456814] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:53:01,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422286658] [2021-08-31 01:53:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:01,577 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:53:01,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:01,578 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:53:01,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-31 01:53:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:01,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 01:53:01,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:53:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 01:53:01,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:53:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 01:53:01,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422286658] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:53:01,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:53:01,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-08-31 01:53:01,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254907966] [2021-08-31 01:53:01,752 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:53:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2021-08-31 01:53:01,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:01,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623664504] [2021-08-31 01:53:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:01,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:01,773 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:53:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:01,778 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:53:01,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:53:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-31 01:53:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-31 01:53:01,903 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-31 01:53:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:53:02,043 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2021-08-31 01:53:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-31 01:53:02,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2021-08-31 01:53:02,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2021-08-31 01:53:02,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2021-08-31 01:53:02,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-08-31 01:53:02,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-08-31 01:53:02,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2021-08-31 01:53:02,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:53:02,049 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 81 transitions. [2021-08-31 01:53:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2021-08-31 01:53:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2021-08-31 01:53:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 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-31 01:53:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-08-31 01:53:02,053 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-08-31 01:53:02,053 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-08-31 01:53:02,053 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 01:53:02,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2021-08-31 01:53:02,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 01:53:02,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:53:02,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:53:02,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2021-08-31 01:53:02,055 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 01:53:02,056 INFO L791 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 499#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 504#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 505#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 506#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 502#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 503#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 529#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 528#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 527#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 526#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 525#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 524#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 523#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 522#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 521#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 520#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 519#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 518#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 517#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 516#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 515#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 514#L18-3 assume !(main_~i~0 < 100000); 507#L18-4 main_~i~0 := 0; 508#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 512#L13 assume !(0 == __VERIFIER_assert_~cond); 550#L13-3 havoc main_#t~mem5; 549#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 533#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 534#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 500#L13 assume !(0 == __VERIFIER_assert_~cond); 501#L13-3 havoc main_#t~mem5; 511#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 535#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 548#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 547#L13 assume !(0 == __VERIFIER_assert_~cond); 546#L13-3 havoc main_#t~mem5; 545#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 544#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 543#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 542#L13 assume !(0 == __VERIFIER_assert_~cond); 541#L13-3 havoc main_#t~mem5; 540#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 539#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 538#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 537#L13 assume !(0 == __VERIFIER_assert_~cond); 536#L13-3 havoc main_#t~mem5; 509#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 510#L22-2 [2021-08-31 01:53:02,056 INFO L793 eck$LassoCheckResult]: Loop: 510#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 513#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 532#L13 assume !(0 == __VERIFIER_assert_~cond); 531#L13-3 havoc main_#t~mem5; 530#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 510#L22-2 [2021-08-31 01:53:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1653685129, now seen corresponding path program 2 times [2021-08-31 01:53:02,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:02,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326208092] [2021-08-31 01:53:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:02,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-31 01:53:02,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:53:02,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326208092] [2021-08-31 01:53:02,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326208092] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:53:02,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736705779] [2021-08-31 01:53:02,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 01:53:02,219 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:53:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:02,221 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:53:02,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-31 01:53:02,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 01:53:02,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:53:02,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-31 01:53:02,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:53:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-31 01:53:02,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:53:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-31 01:53:02,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736705779] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:53:02,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:53:02,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-08-31 01:53:02,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405898252] [2021-08-31 01:53:02,629 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:53:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2021-08-31 01:53:02,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:02,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663017071] [2021-08-31 01:53:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:02,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:02,635 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:53:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:02,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:53:02,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:53:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-31 01:53:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-08-31 01:53:02,747 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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-31 01:53:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:53:03,006 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2021-08-31 01:53:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-31 01:53:03,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2021-08-31 01:53:03,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-08-31 01:53:03,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2021-08-31 01:53:03,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2021-08-31 01:53:03,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2021-08-31 01:53:03,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2021-08-31 01:53:03,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:53:03,012 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 171 transitions. [2021-08-31 01:53:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2021-08-31 01:53:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2021-08-31 01:53:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 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-31 01:53:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2021-08-31 01:53:03,020 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-08-31 01:53:03,020 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-08-31 01:53:03,020 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 01:53:03,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2021-08-31 01:53:03,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 01:53:03,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:53:03,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:53:03,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2021-08-31 01:53:03,024 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 01:53:03,024 INFO L791 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 1021#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 1026#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1027#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1028#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1024#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1025#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1075#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1074#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1073#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1072#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1071#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1070#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1069#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1068#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1067#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1066#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1065#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1064#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1063#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1062#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1061#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1060#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1059#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1058#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1057#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1056#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1055#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1054#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1053#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1052#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1051#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1050#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1049#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1048#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1047#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1046#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1045#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1044#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1043#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1042#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1041#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1040#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1039#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1038#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1037#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 1036#L18-3 assume !(main_~i~0 < 100000); 1029#L18-4 main_~i~0 := 0; 1030#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1034#L13 assume !(0 == __VERIFIER_assert_~cond); 1126#L13-3 havoc main_#t~mem5; 1125#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1079#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1080#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1022#L13 assume !(0 == __VERIFIER_assert_~cond); 1023#L13-3 havoc main_#t~mem5; 1033#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1081#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1124#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1123#L13 assume !(0 == __VERIFIER_assert_~cond); 1122#L13-3 havoc main_#t~mem5; 1121#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1120#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1119#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1118#L13 assume !(0 == __VERIFIER_assert_~cond); 1117#L13-3 havoc main_#t~mem5; 1116#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1115#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1114#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1113#L13 assume !(0 == __VERIFIER_assert_~cond); 1112#L13-3 havoc main_#t~mem5; 1111#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1110#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1109#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1108#L13 assume !(0 == __VERIFIER_assert_~cond); 1107#L13-3 havoc main_#t~mem5; 1106#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1105#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1104#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1103#L13 assume !(0 == __VERIFIER_assert_~cond); 1102#L13-3 havoc main_#t~mem5; 1101#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1100#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1099#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1098#L13 assume !(0 == __VERIFIER_assert_~cond); 1097#L13-3 havoc main_#t~mem5; 1096#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1095#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1094#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1093#L13 assume !(0 == __VERIFIER_assert_~cond); 1092#L13-3 havoc main_#t~mem5; 1091#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1090#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1089#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1088#L13 assume !(0 == __VERIFIER_assert_~cond); 1087#L13-3 havoc main_#t~mem5; 1086#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1085#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1084#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1083#L13 assume !(0 == __VERIFIER_assert_~cond); 1082#L13-3 havoc main_#t~mem5; 1031#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1032#L22-2 [2021-08-31 01:53:03,024 INFO L793 eck$LassoCheckResult]: Loop: 1032#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1035#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1078#L13 assume !(0 == __VERIFIER_assert_~cond); 1077#L13-3 havoc main_#t~mem5; 1076#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 1032#L22-2 [2021-08-31 01:53:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1459869857, now seen corresponding path program 3 times [2021-08-31 01:53:03,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:03,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702670392] [2021-08-31 01:53:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:03,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:53:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2021-08-31 01:53:03,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:53:03,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702670392] [2021-08-31 01:53:03,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702670392] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:53:03,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391772034] [2021-08-31 01:53:03,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-31 01:53:03,404 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:53:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:53:03,409 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-31 01:53:03,415 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-31 01:53:03,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-31 01:53:03,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:53:03,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-31 01:53:03,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:53:03,657 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 16 treesize of output 12 [2021-08-31 01:53:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2021-08-31 01:53:03,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 01:53:03,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391772034] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:53:03,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 01:53:03,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2021-08-31 01:53:03,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47917004] [2021-08-31 01:53:03,729 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:53:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:53:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2021-08-31 01:53:03,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:53:03,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020236444] [2021-08-31 01:53:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:53:03,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:53:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:03,734 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:53:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:53:03,738 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:53:03,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:53:03,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 01:53:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2021-08-31 01:53:03,850 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-31 01:53:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:53:03,890 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2021-08-31 01:53:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 01:53:03,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2021-08-31 01:53:03,891 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 01:53:03,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2021-08-31 01:53:03,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 01:53:03,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 01:53:03,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 01:53:03,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:53:03,892 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:53:03,892 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:53:03,892 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 01:53:03,892 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 01:53:03,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 01:53:03,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 01:53:03,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 01:53:03,894 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 01:53:03,897 INFO L158 Benchmark]: Toolchain (without parser) took 5856.18ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 56.8MB in the beginning and 46.1MB in the end (delta: 10.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2021-08-31 01:53:03,897 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory was 56.0MB in the beginning and 56.0MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:53:03,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.50ms. Allocated memory is still 75.5MB. Free memory was 56.5MB in the beginning and 58.2MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 01:53:03,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.92ms. Allocated memory is still 75.5MB. Free memory was 58.2MB in the beginning and 56.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:53:03,898 INFO L158 Benchmark]: Boogie Preprocessor took 35.44ms. Allocated memory is still 75.5MB. Free memory was 56.5MB in the beginning and 55.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:53:03,898 INFO L158 Benchmark]: RCFGBuilder took 214.57ms. Allocated memory is still 75.5MB. Free memory was 55.5MB in the beginning and 46.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-31 01:53:03,899 INFO L158 Benchmark]: BuchiAutomizer took 5360.43ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 46.9MB in the beginning and 46.1MB in the end (delta: 802.6kB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2021-08-31 01:53:03,900 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.19ms. Allocated memory is still 75.5MB. Free memory was 56.0MB in the beginning and 56.0MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.50ms. Allocated memory is still 75.5MB. Free memory was 56.5MB in the beginning and 58.2MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.92ms. Allocated memory is still 75.5MB. Free memory was 58.2MB in the beginning and 56.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.44ms. Allocated memory is still 75.5MB. Free memory was 56.5MB in the beginning and 55.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 214.57ms. Allocated memory is still 75.5MB. Free memory was 55.5MB in the beginning and 46.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5360.43ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 46.9MB in the beginning and 46.1MB in the end (delta: 802.6kB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 01:53:03,929 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-31 01:53:04,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:04,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-08-31 01:53:04,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-31 01:53:04,723 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...