./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 13:55:30,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 13:55:30,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 13:55:30,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 13:55:30,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 13:55:30,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 13:55:30,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 13:55:30,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 13:55:30,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 13:55:30,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 13:55:30,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 13:55:30,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 13:55:30,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 13:55:30,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 13:55:30,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 13:55:30,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 13:55:30,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 13:55:30,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 13:55:30,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 13:55:30,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 13:55:30,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 13:55:30,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 13:55:30,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 13:55:30,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 13:55:30,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 13:55:30,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 13:55:30,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 13:55:30,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 13:55:30,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 13:55:30,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 13:55:30,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 13:55:30,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 13:55:30,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 13:55:30,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 13:55:30,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 13:55:30,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 13:55:30,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 13:55:30,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 13:55:30,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 13:55:30,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 13:55:30,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 13:55:30,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 13:55:30,229 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 13:55:30,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 13:55:30,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 13:55:30,232 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 13:55:30,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 13:55:30,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 13:55:30,234 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 13:55:30,234 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 13:55:30,234 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 13:55:30,234 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 13:55:30,235 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 13:55:30,235 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 13:55:30,235 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 13:55:30,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 13:55:30,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 13:55:30,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 13:55:30,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 13:55:30,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 13:55:30,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 13:55:30,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 13:55:30,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 13:55:30,237 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 13:55:30,237 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 13:55:30,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 13:55:30,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 13:55:30,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 13:55:30,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 13:55:30,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 13:55:30,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 13:55:30,239 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 13:55:30,239 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2021-08-27 13:55:30,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 13:55:30,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 13:55:30,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 13:55:30,568 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 13:55:30,569 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 13:55:30,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2021-08-27 13:55:30,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9048e0219/57be73cb9d0c403c86e2046ca6359251/FLAGcd2984f60 [2021-08-27 13:55:31,089 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 13:55:31,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2021-08-27 13:55:31,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9048e0219/57be73cb9d0c403c86e2046ca6359251/FLAGcd2984f60 [2021-08-27 13:55:31,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9048e0219/57be73cb9d0c403c86e2046ca6359251 [2021-08-27 13:55:31,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 13:55:31,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 13:55:31,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 13:55:31,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 13:55:31,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 13:55:31,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77393361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31, skipping insertion in model container [2021-08-27 13:55:31,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 13:55:31,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 13:55:31,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 13:55:31,298 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 13:55:31,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 13:55:31,327 INFO L208 MainTranslator]: Completed translation [2021-08-27 13:55:31,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31 WrapperNode [2021-08-27 13:55:31,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 13:55:31,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 13:55:31,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 13:55:31,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 13:55:31,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 13:55:31,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 13:55:31,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 13:55:31,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 13:55:31,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 13:55:31,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 13:55:31,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 13:55:31,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 13:55:31,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (1/1) ... [2021-08-27 13:55:31,425 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:31,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 13:55:31,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 13:55:31,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 13:55:31,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 13:55:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 13:55:31,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 13:55:31,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 13:55:31,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 13:55:31,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 13:55:31,744 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-27 13:55:31,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:55:31 BoogieIcfgContainer [2021-08-27 13:55:31,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 13:55:31,746 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 13:55:31,746 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 13:55:31,748 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 13:55:31,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 13:55:31,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 01:55:31" (1/3) ... [2021-08-27 13:55:31,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bf77c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 01:55:31, skipping insertion in model container [2021-08-27 13:55:31,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 13:55:31,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:55:31" (2/3) ... [2021-08-27 13:55:31,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bf77c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 01:55:31, skipping insertion in model container [2021-08-27 13:55:31,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 13:55:31,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:55:31" (3/3) ... [2021-08-27 13:55:31,751 INFO L389 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2021-08-27 13:55:31,805 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 13:55:31,805 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 13:55:31,805 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 13:55:31,805 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 13:55:31,805 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 13:55:31,805 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 13:55:31,805 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 13:55:31,806 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 13:55:31,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:31,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-27 13:55:31,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:31,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:31,842 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 13:55:31,842 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 13:55:31,842 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 13:55:31,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:31,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-27 13:55:31,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:31,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:31,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 13:55:31,845 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 13:55:31,850 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 9#L13-3true [2021-08-27 13:55:31,850 INFO L793 eck$LassoCheckResult]: Loop: 9#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 9#L13-3true [2021-08-27 13:55:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 13:55:31,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:31,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693847527] [2021-08-27 13:55:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:31,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:31,943 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:31,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 13:55:31,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:31,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452717997] [2021-08-27 13:55:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:31,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:31,997 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:32,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 13:55:32,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:32,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820390318] [2021-08-27 13:55:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:32,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:32,041 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:32,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:32,296 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 13:55:32,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 13:55:32,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 13:55:32,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 13:55:32,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 13:55:32,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 13:55:32,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 13:55:32,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2021-08-27 13:55:32,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 13:55:32,298 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 13:55:32,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 13:55:32,503 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 13:55:32,507 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 13:55:32,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,513 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-27 13:55:32,519 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-27 13:55:32,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:32,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:32,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:32,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 13:55:32,571 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,577 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-27 13:55:32,578 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-27 13:55:32,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:32,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:32,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:32,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 13:55:32,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,623 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-27 13:55:32,624 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-27 13:55:32,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:32,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:32,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:32,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,669 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-27 13:55:32,669 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,670 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-27 13:55:32,670 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-27 13:55:32,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:32,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:32,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:32,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,722 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-27 13:55:32,722 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,723 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-27 13:55:32,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,736 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-27 13:55:32,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 13:55:32,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 13:55:32,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-08-27 13:55:32,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,782 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-27 13:55:32,783 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-27 13:55:32,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:32,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:32,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:32,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-27 13:55:32,824 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,825 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-27 13:55:32,826 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-27 13:55:32,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 13:55:32,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 13:55:32,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,875 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-27 13:55:32,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,876 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-27 13:55:32,877 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-27 13:55:32,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 13:55:32,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 13:55:32,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-08-27 13:55:32,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,917 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 13:55:32,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 13:55:32,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 13:55:32,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 13:55:32,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:32,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 13:55:32,964 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:32,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:32,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 13:55:32,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 13:55:32,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:32,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:32,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:32,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:32,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:32,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:32,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:32,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:32,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:33,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-08-27 13:55:33,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:33,006 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 13:55:33,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 13:55:33,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:33,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:33,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 13:55:33,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:33,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:33,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:33,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 13:55:33,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 13:55:33,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 13:55:33,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-08-27 13:55:33,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:33,053 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 13:55:33,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 13:55:33,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 13:55:33,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 13:55:33,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 13:55:33,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 13:55:33,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 13:55:33,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 13:55:33,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 13:55:33,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 13:55:33,127 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-08-27 13:55:33,127 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 13:55:33,129 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 13:55:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:33,133 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 13:55:33,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 13:55:33,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 13:55:33,166 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 13:55:33,167 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 13:55:33,167 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~n~0 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2021-08-27 13:55:33,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 13:55:33,198 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2021-08-27 13:55:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:33,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 13:55:33,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:33,247 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 13:55:33,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:33,309 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-27 13:55:33,310 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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-27 13:55:33,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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 25 states and 37 transitions. Complement of second has 8 states. [2021-08-27 13:55:33,361 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-27 13:55:33,363 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-27 13:55:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-08-27 13:55:33,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 13:55:33,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 13:55:33,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 13:55:33,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 13:55:33,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 13:55:33,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 13:55:33,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. [2021-08-27 13:55:33,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:33,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 12 transitions. [2021-08-27 13:55:33,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:33,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 13:55:33,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2021-08-27 13:55:33,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:33,375 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2021-08-27 13:55:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2021-08-27 13:55:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-08-27 13:55:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2021-08-27 13:55:33,393 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-08-27 13:55:33,393 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-08-27 13:55:33,393 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 13:55:33,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2021-08-27 13:55:33,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:33,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:33,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:33,394 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-27 13:55:33,394 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:33,394 INFO L791 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 87#L13-3 assume !(main_~n~0 < 10); 82#L17-4 [2021-08-27 13:55:33,395 INFO L793 eck$LassoCheckResult]: Loop: 82#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 80#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 81#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 82#L17-4 [2021-08-27 13:55:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2021-08-27 13:55:33,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:33,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065542929] [2021-08-27 13:55:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:33,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:33,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:33,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065542929] [2021-08-27 13:55:33,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065542929] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 13:55:33,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 13:55:33,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 13:55:33,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560726004] [2021-08-27 13:55:33,427 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2021-08-27 13:55:33,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:33,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635526841] [2021-08-27 13:55:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:33,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:33,441 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:33,446 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:33,473 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-27 13:55:33,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 13:55:33,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 13:55:33,598 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:33,610 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2021-08-27 13:55:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 13:55:33,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2021-08-27 13:55:33,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:33,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2021-08-27 13:55:33,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:33,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:33,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2021-08-27 13:55:33,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:33,614 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-08-27 13:55:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2021-08-27 13:55:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-08-27 13:55:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2021-08-27 13:55:33,617 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-08-27 13:55:33,617 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-08-27 13:55:33,617 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 13:55:33,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2021-08-27 13:55:33,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:33,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:33,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:33,618 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 13:55:33,618 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:33,619 INFO L791 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 107#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 110#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 108#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 109#L13-3 assume !(main_~n~0 < 10); 105#L17-4 [2021-08-27 13:55:33,619 INFO L793 eck$LassoCheckResult]: Loop: 105#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 103#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 104#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 105#L17-4 [2021-08-27 13:55:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2021-08-27 13:55:33,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:33,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242795391] [2021-08-27 13:55:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:33,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:33,664 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-27 13:55:33,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:33,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242795391] [2021-08-27 13:55:33,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242795391] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:33,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074815338] [2021-08-27 13:55:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:33,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:33,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:33,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 13:55:33,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 13:55:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:33,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 13:55:33,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:33,761 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-27 13:55:33,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074815338] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:33,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:33,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-08-27 13:55:33,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820363589] [2021-08-27 13:55:33,762 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2021-08-27 13:55:33,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:33,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223371420] [2021-08-27 13:55:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:33,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:33,774 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:33,782 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:33,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 13:55:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 13:55:33,901 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:33,916 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2021-08-27 13:55:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 13:55:33,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2021-08-27 13:55:33,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:33,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2021-08-27 13:55:33,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:33,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:33,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2021-08-27 13:55:33,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:33,919 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-08-27 13:55:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2021-08-27 13:55:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-08-27 13:55:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2021-08-27 13:55:33,922 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2021-08-27 13:55:33,922 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2021-08-27 13:55:33,922 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 13:55:33,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2021-08-27 13:55:33,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:33,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:33,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:33,925 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2021-08-27 13:55:33,926 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:33,926 INFO L791 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 146#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 147#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 148#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 151#L13-3 assume !(main_~n~0 < 10); 144#L17-4 [2021-08-27 13:55:33,926 INFO L793 eck$LassoCheckResult]: Loop: 144#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 142#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 143#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 144#L17-4 [2021-08-27 13:55:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2021-08-27 13:55:33,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:33,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765726930] [2021-08-27 13:55:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:33,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:33,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:33,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765726930] [2021-08-27 13:55:33,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765726930] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:33,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196970784] [2021-08-27 13:55:33,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 13:55:33,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:33,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:33,991 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-27 13:55:33,992 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-27 13:55:34,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 13:55:34,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:34,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 13:55:34,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196970784] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:34,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 13:55:34,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758305656] [2021-08-27 13:55:34,070 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2021-08-27 13:55:34,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158304556] [2021-08-27 13:55:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:34,076 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:34,080 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:34,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 13:55:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 13:55:34,186 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:34,204 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-08-27 13:55:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 13:55:34,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2021-08-27 13:55:34,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:34,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2021-08-27 13:55:34,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:34,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:34,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2021-08-27 13:55:34,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:34,207 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 13:55:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2021-08-27 13:55:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-08-27 13:55:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-08-27 13:55:34,209 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-08-27 13:55:34,209 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-08-27 13:55:34,210 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 13:55:34,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2021-08-27 13:55:34,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:34,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:34,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:34,211 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2021-08-27 13:55:34,211 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:34,212 INFO L791 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 197#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 198#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 202#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 201#L13-3 assume !(main_~n~0 < 10); 194#L17-4 [2021-08-27 13:55:34,212 INFO L793 eck$LassoCheckResult]: Loop: 194#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 192#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 193#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 194#L17-4 [2021-08-27 13:55:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2021-08-27 13:55:34,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252843475] [2021-08-27 13:55:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:34,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252843475] [2021-08-27 13:55:34,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252843475] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34276453] [2021-08-27 13:55:34,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 13:55:34,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:34,284 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-27 13:55:34,284 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-27 13:55:34,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 13:55:34,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:34,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 13:55:34,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34276453] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:34,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 13:55:34,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683799097] [2021-08-27 13:55:34,374 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2021-08-27 13:55:34,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812933517] [2021-08-27 13:55:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:34,378 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:34,382 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:34,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 13:55:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 13:55:34,477 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:34,494 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-08-27 13:55:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 13:55:34,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2021-08-27 13:55:34,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:34,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2021-08-27 13:55:34,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:34,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:34,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2021-08-27 13:55:34,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:34,496 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 13:55:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2021-08-27 13:55:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-08-27 13:55:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-08-27 13:55:34,498 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-27 13:55:34,498 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-27 13:55:34,498 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 13:55:34,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-08-27 13:55:34,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:34,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:34,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:34,499 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2021-08-27 13:55:34,499 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:34,499 INFO L791 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 257#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 262#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 258#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 259#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 264#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !(main_~n~0 < 10); 255#L17-4 [2021-08-27 13:55:34,499 INFO L793 eck$LassoCheckResult]: Loop: 255#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 253#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 254#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 255#L17-4 [2021-08-27 13:55:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2021-08-27 13:55:34,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111419138] [2021-08-27 13:55:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:34,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111419138] [2021-08-27 13:55:34,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111419138] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335639212] [2021-08-27 13:55:34,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 13:55:34,542 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:34,545 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-27 13:55:34,576 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-27 13:55:34,605 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 13:55:34,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:34,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 13:55:34,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335639212] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:34,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 13:55:34,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285544659] [2021-08-27 13:55:34,658 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2021-08-27 13:55:34,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455547156] [2021-08-27 13:55:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:34,667 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:34,678 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:34,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 13:55:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 13:55:34,780 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:34,800 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-08-27 13:55:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 13:55:34,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-08-27 13:55:34,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:34,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2021-08-27 13:55:34,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:34,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:34,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-08-27 13:55:34,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:34,801 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 13:55:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-08-27 13:55:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-27 13:55:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-08-27 13:55:34,803 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-27 13:55:34,803 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-27 13:55:34,803 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 13:55:34,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2021-08-27 13:55:34,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:34,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:34,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:34,804 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2021-08-27 13:55:34,804 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:34,804 INFO L791 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 334#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 330#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 331#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 336#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !(main_~n~0 < 10); 327#L17-4 [2021-08-27 13:55:34,804 INFO L793 eck$LassoCheckResult]: Loop: 327#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 325#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 326#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 327#L17-4 [2021-08-27 13:55:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2021-08-27 13:55:34,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132914780] [2021-08-27 13:55:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:34,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132914780] [2021-08-27 13:55:34,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132914780] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737759740] [2021-08-27 13:55:34,856 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 13:55:34,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:34,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:34,857 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 13:55:34,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 13:55:34,921 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 13:55:34,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:34,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 13:55:34,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:34,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737759740] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:34,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:34,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 13:55:34,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619242784] [2021-08-27 13:55:34,997 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2021-08-27 13:55:34,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:34,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918459129] [2021-08-27 13:55:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:34,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:35,009 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:35,022 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:35,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:35,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 13:55:35,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 13:55:35,117 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:35,142 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-08-27 13:55:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 13:55:35,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-08-27 13:55:35,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:35,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2021-08-27 13:55:35,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:35,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:35,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2021-08-27 13:55:35,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:35,144 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-27 13:55:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2021-08-27 13:55:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-08-27 13:55:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-08-27 13:55:35,145 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 13:55:35,145 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 13:55:35,146 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 13:55:35,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2021-08-27 13:55:35,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:35,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:35,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:35,146 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2021-08-27 13:55:35,146 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:35,146 INFO L791 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 412#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 417#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 413#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 414#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 419#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !(main_~n~0 < 10); 410#L17-4 [2021-08-27 13:55:35,147 INFO L793 eck$LassoCheckResult]: Loop: 410#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 408#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 409#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 410#L17-4 [2021-08-27 13:55:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2021-08-27 13:55:35,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:35,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124551390] [2021-08-27 13:55:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:35,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:35,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:35,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124551390] [2021-08-27 13:55:35,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124551390] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:35,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991519971] [2021-08-27 13:55:35,221 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 13:55:35,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:35,225 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 13:55:35,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 13:55:35,296 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 13:55:35,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:35,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 13:55:35,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:35,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991519971] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:35,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:35,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 13:55:35,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22630499] [2021-08-27 13:55:35,368 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2021-08-27 13:55:35,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:35,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445362248] [2021-08-27 13:55:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:35,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:35,372 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:35,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:35,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 13:55:35,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 13:55:35,471 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:35,505 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-08-27 13:55:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 13:55:35,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2021-08-27 13:55:35,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:35,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2021-08-27 13:55:35,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:35,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:35,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2021-08-27 13:55:35,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:35,507 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 13:55:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2021-08-27 13:55:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-08-27 13:55:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-08-27 13:55:35,509 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-08-27 13:55:35,509 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-08-27 13:55:35,509 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 13:55:35,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2021-08-27 13:55:35,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:35,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:35,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:35,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2021-08-27 13:55:35,510 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:35,510 INFO L791 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 506#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 511#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 507#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 508#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 513#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !(main_~n~0 < 10); 504#L17-4 [2021-08-27 13:55:35,510 INFO L793 eck$LassoCheckResult]: Loop: 504#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 502#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 503#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 504#L17-4 [2021-08-27 13:55:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2021-08-27 13:55:35,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:35,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376116700] [2021-08-27 13:55:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:35,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:35,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:35,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376116700] [2021-08-27 13:55:35,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376116700] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:35,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744861019] [2021-08-27 13:55:35,585 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 13:55:35,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:35,625 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 13:55:35,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 13:55:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:35,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 13:55:35,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:35,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744861019] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:35,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:35,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 13:55:35,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459177479] [2021-08-27 13:55:35,756 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2021-08-27 13:55:35,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:35,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995290732] [2021-08-27 13:55:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:35,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:35,760 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:35,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:35,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 13:55:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 13:55:35,883 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:35,910 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-08-27 13:55:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 13:55:35,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2021-08-27 13:55:35,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:35,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2021-08-27 13:55:35,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:35,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:35,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2021-08-27 13:55:35,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:35,912 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-08-27 13:55:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2021-08-27 13:55:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 13:55:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-08-27 13:55:35,913 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 13:55:35,913 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 13:55:35,913 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 13:55:35,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-08-27 13:55:35,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:35,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:35,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:35,914 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2021-08-27 13:55:35,914 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:35,914 INFO L791 eck$LassoCheckResult]: Stem: 610#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 616#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 612#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 613#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 618#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !(main_~n~0 < 10); 609#L17-4 [2021-08-27 13:55:35,915 INFO L793 eck$LassoCheckResult]: Loop: 609#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 607#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 608#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 609#L17-4 [2021-08-27 13:55:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2021-08-27 13:55:35,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:35,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783537675] [2021-08-27 13:55:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:35,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:36,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:36,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783537675] [2021-08-27 13:55:36,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783537675] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:36,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759396456] [2021-08-27 13:55:36,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 13:55:36,009 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:36,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:36,009 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 13:55:36,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 13:55:36,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 13:55:36,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:36,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 13:55:36,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:36,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759396456] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:36,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:36,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 13:55:36,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296042715] [2021-08-27 13:55:36,174 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2021-08-27 13:55:36,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:36,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060515894] [2021-08-27 13:55:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:36,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,180 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:36,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 13:55:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 13:55:36,273 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:36,306 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-08-27 13:55:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 13:55:36,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2021-08-27 13:55:36,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:36,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2021-08-27 13:55:36,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:36,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:36,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2021-08-27 13:55:36,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:36,308 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-08-27 13:55:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2021-08-27 13:55:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-08-27 13:55:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-08-27 13:55:36,309 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 13:55:36,309 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 13:55:36,309 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 13:55:36,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2021-08-27 13:55:36,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:36,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:36,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:36,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2021-08-27 13:55:36,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:36,310 INFO L791 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 732#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 728#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 729#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 734#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !(main_~n~0 < 10); 725#L17-4 [2021-08-27 13:55:36,310 INFO L793 eck$LassoCheckResult]: Loop: 725#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 723#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 724#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 725#L17-4 [2021-08-27 13:55:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2021-08-27 13:55:36,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:36,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115913370] [2021-08-27 13:55:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:36,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 13:55:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:36,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 13:55:36,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115913370] [2021-08-27 13:55:36,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115913370] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:36,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322656929] [2021-08-27 13:55:36,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 13:55:36,410 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 13:55:36,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 13:55:36,411 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 13:55:36,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 13:55:36,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 13:55:36,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 13:55:36,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 13:55:36,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 13:55:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 13:55:36,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322656929] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 13:55:36,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 13:55:36,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 13:55:36,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903226341] [2021-08-27 13:55:36,595 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 13:55:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2021-08-27 13:55:36,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:36,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578780935] [2021-08-27 13:55:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:36,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,599 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:36,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 13:55:36,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 13:55:36,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 13:55:36,698 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 13:55:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 13:55:36,744 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2021-08-27 13:55:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 13:55:36,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2021-08-27 13:55:36,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:36,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2021-08-27 13:55:36,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 13:55:36,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 13:55:36,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2021-08-27 13:55:36,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 13:55:36,746 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-27 13:55:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2021-08-27 13:55:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-27 13:55:36,747 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-27 13:55:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-08-27 13:55:36,748 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-27 13:55:36,748 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-27 13:55:36,748 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 13:55:36,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2021-08-27 13:55:36,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 13:55:36,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 13:55:36,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 13:55:36,749 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2021-08-27 13:55:36,749 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 13:55:36,750 INFO L791 eck$LassoCheckResult]: Stem: 852#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 858#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 854#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 855#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 860#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !(main_~n~0 < 10); 851#L17-4 [2021-08-27 13:55:36,750 INFO L793 eck$LassoCheckResult]: Loop: 851#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 849#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 850#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 851#L17-4 [2021-08-27 13:55:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2021-08-27 13:55:36,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:36,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180551178] [2021-08-27 13:55:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:36,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,761 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,782 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2021-08-27 13:55:36,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:36,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204928744] [2021-08-27 13:55:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:36,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,788 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 13:55:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2021-08-27 13:55:36,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 13:55:36,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839660493] [2021-08-27 13:55:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 13:55:36,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 13:55:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,811 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 13:55:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 13:55:36,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 13:55:39,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 01:55:39 BoogieIcfgContainer [2021-08-27 13:55:39,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 13:55:39,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 13:55:39,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 13:55:39,777 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 13:55:39,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:55:31" (3/4) ... [2021-08-27 13:55:39,783 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 13:55:39,841 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 13:55:39,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 13:55:39,843 INFO L168 Benchmark]: Toolchain (without parser) took 8717.03 ms. Allocated memory was 52.4 MB in the beginning and 140.5 MB in the end (delta: 88.1 MB). Free memory was 30.0 MB in the beginning and 48.1 MB in the end (delta: -18.1 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. [2021-08-27 13:55:39,843 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 52.4 MB. Free memory was 34.9 MB in the beginning and 34.9 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 13:55:39,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.33 ms. Allocated memory is still 52.4 MB. Free memory was 29.8 MB in the beginning and 34.6 MB in the end (delta: -4.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2021-08-27 13:55:39,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.77 ms. Allocated memory is still 52.4 MB. Free memory was 34.6 MB in the beginning and 33.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 13:55:39,844 INFO L168 Benchmark]: Boogie Preprocessor took 60.39 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 33.2 MB in the beginning and 47.0 MB in the end (delta: -13.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 13:55:39,844 INFO L168 Benchmark]: RCFGBuilder took 326.96 ms. Allocated memory is still 62.9 MB. Free memory was 47.0 MB in the beginning and 35.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 13:55:39,845 INFO L168 Benchmark]: BuchiAutomizer took 8030.55 ms. Allocated memory was 62.9 MB in the beginning and 140.5 MB in the end (delta: 77.6 MB). Free memory was 35.3 MB in the beginning and 50.2 MB in the end (delta: -14.8 MB). Peak memory consumption was 75.5 MB. Max. memory is 16.1 GB. [2021-08-27 13:55:39,845 INFO L168 Benchmark]: Witness Printer took 64.93 ms. Allocated memory is still 140.5 MB. Free memory was 50.2 MB in the beginning and 48.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 13:55:39,846 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.19 ms. Allocated memory is still 52.4 MB. Free memory was 34.9 MB in the beginning and 34.9 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 200.33 ms. Allocated memory is still 52.4 MB. Free memory was 29.8 MB in the beginning and 34.6 MB in the end (delta: -4.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.77 ms. Allocated memory is still 52.4 MB. Free memory was 34.6 MB in the beginning and 33.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.39 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 33.2 MB in the beginning and 47.0 MB in the end (delta: -13.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 326.96 ms. Allocated memory is still 62.9 MB. Free memory was 47.0 MB in the beginning and 35.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 8030.55 ms. Allocated memory was 62.9 MB in the beginning and 140.5 MB in the end (delta: 77.6 MB). Free memory was 35.3 MB in the beginning and 50.2 MB in the end (delta: -14.8 MB). Peak memory consumption was 75.5 MB. Max. memory is 16.1 GB. * Witness Printer took 64.93 ms. Allocated memory is still 140.5 MB. Free memory was 50.2 MB in the beginning and 48.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 19 * unknown-#length-unknown[a] + -8 * n and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 7.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 25.3ms AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 62 SDslu, 131 SDs, 0 SdLazy, 180 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 171.2ms Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5bedd745=0, NULL=0, \result=0, NULL=1, n=10, i=7, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ec07801=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7790aea5=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a6daff8=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64ca1784=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@721b95ef=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 13:55:39,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-27 13:55:40,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-08-27 13:55:40,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-08-27 13:55:40,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-08-27 13:55:40,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-27 13:55:40,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-27 13:55:41,102 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-27 13:55:41,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-08-27 13:55:41,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-08-27 13:55:41,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...