./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 6c24879c 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 a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:05:34,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:05:34,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:05:34,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:05:34,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:05:34,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:05:34,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:05:34,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:05:34,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:05:34,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:05:34,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:05:34,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:05:34,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:05:34,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:05:34,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:05:34,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:05:34,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:05:34,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:05:34,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:05:34,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:05:34,960 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:05:34,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:05:34,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:05:34,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:05:34,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:05:34,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:05:34,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:05:34,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:05:34,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:05:34,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:05:34,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:05:34,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:05:34,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:05:34,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:05:34,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:05:34,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:05:34,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:05:34,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:05:34,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:05:34,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:05:34,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:05:34,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:05:34,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:05:34,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:05:34,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:05:34,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:05:34,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:05:35,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:05:35,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:05:35,000 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:05:35,001 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:05:35,001 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:05:35,001 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:05:35,002 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:05:35,002 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:05:35,002 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:05:35,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:05:35,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:05:35,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:05:35,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:05:35,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:05:35,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:05:35,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:05:35,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:05:35,004 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:05:35,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:05:35,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:05:35,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:05:35,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:05:35,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:05:35,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:05:35,006 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:05:35,006 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 -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2022-07-13 03:05:35,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:05:35,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:05:35,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:05:35,226 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:05:35,227 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:05:35,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2022-07-13 03:05:35,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9e4818f/90123f8bb72546b2be5da993667067f2/FLAG5df17e9e1 [2022-07-13 03:05:35,642 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:05:35,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2022-07-13 03:05:35,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9e4818f/90123f8bb72546b2be5da993667067f2/FLAG5df17e9e1 [2022-07-13 03:05:36,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9e4818f/90123f8bb72546b2be5da993667067f2 [2022-07-13 03:05:36,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:05:36,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:05:36,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:05:36,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:05:36,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:05:36,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51540fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36, skipping insertion in model container [2022-07-13 03:05:36,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:05:36,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:05:36,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:05:36,281 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:05:36,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:05:36,301 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:05:36,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36 WrapperNode [2022-07-13 03:05:36,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:05:36,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:05:36,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:05:36,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:05:36,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,322 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-07-13 03:05:36,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:05:36,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:05:36,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:05:36,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:05:36,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:05:36,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:05:36,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:05:36,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:05:36,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (1/1) ... [2022-07-13 03:05:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:05:36,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:05:36,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:05:36,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:05:36,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:05:36,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:05:36,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:05:36,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:05:36,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:05:36,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:05:36,442 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:05:36,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:05:36,556 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:05:36,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:05:36,572 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:05:36,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:05:36 BoogieIcfgContainer [2022-07-13 03:05:36,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:05:36,584 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:05:36,584 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:05:36,586 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:05:36,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:05:36,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:05:36" (1/3) ... [2022-07-13 03:05:36,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4320edad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:05:36, skipping insertion in model container [2022-07-13 03:05:36,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:05:36,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:05:36" (2/3) ... [2022-07-13 03:05:36,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4320edad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:05:36, skipping insertion in model container [2022-07-13 03:05:36,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:05:36,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:05:36" (3/3) ... [2022-07-13 03:05:36,590 INFO L354 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2022-07-13 03:05:36,637 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:05:36,637 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:05:36,638 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:05:36,638 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:05:36,638 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:05:36,638 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:05:36,638 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:05:36,638 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:05:36,659 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) [2022-07-13 03:05:36,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 03:05:36,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:05:36,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:05:36,673 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:05:36,673 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:05:36,674 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:05:36,674 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) [2022-07-13 03:05:36,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 03:05:36,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:05:36,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:05:36,676 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:05:36,676 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:05:36,680 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 8#L13-3true [2022-07-13 03:05:36,681 INFO L754 eck$LassoCheckResult]: Loop: 8#L13-3true assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 7#L13-2true main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 8#L13-3true [2022-07-13 03:05:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:05:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:36,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271325600] [2022-07-13 03:05:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:36,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:36,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-13 03:05:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:36,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638562328] [2022-07-13 03:05:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:36,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:36,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:36,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-13 03:05:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:36,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573330189] [2022-07-13 03:05:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:36,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:36,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:37,026 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:05:37,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:05:37,027 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:05:37,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:05:37,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:05:37,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:05:37,027 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:05:37,027 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:05:37,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2022-07-13 03:05:37,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:05:37,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:05:37,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:05:37,229 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:05:37,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:05:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:05:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:05:37,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:05:37,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:05:37,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:05:37,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:05:37,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:05:37,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:05:37,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:05:37,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:05:37,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:05:37,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:05:37,332 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 03:05:37,332 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-13 03:05:37,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:05:37,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:05:37,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:05:37,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:05:37,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:05:37,382 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:05:37,383 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:05:37,384 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~n~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-07-13 03:05:37,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 03:05:37,405 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-13 03:05:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:05:37,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:05:37,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:05:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:05:37,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:05:37,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:05:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:37,514 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 [2022-07-13 03:05:37,515 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) [2022-07-13 03:05:37,562 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. [2022-07-13 03:05:37,563 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 [2022-07-13 03:05:37,567 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) [2022-07-13 03:05:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-13 03:05:37,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 03:05:37,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:05:37,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:05:37,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:05:37,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 03:05:37,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:05:37,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. [2022-07-13 03:05:37,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:37,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 12 transitions. [2022-07-13 03:05:37,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:05:37,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:05:37,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-07-13 03:05:37,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:05:37,580 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-13 03:05:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-07-13 03:05:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-13 03:05:37,593 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) [2022-07-13 03:05:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-07-13 03:05:37,595 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-13 03:05:37,595 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-13 03:05:37,595 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:05:37,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-07-13 03:05:37,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:37,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:05:37,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:05:37,596 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:05:37,596 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:05:37,597 INFO L752 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 87#L13-3 assume !(main_~n~0#1 < 10); 82#L17-4 [2022-07-13 03:05:37,597 INFO L754 eck$LassoCheckResult]: Loop: 82#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 80#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 81#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 82#L17-4 [2022-07-13 03:05:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-07-13 03:05:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:37,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355852674] [2022-07-13 03:05:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:05:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:37,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:05:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355852674] [2022-07-13 03:05:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355852674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:05:37,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:05:37,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:05:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391507210] [2022-07-13 03:05:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:05:37,640 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:05:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2022-07-13 03:05:37,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:37,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555542861] [2022-07-13 03:05:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:37,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:37,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:05:37,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:05:37,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:05:37,750 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) [2022-07-13 03:05:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:05:37,777 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-07-13 03:05:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:05:37,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2022-07-13 03:05:37,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:37,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2022-07-13 03:05:37,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:05:37,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:05:37,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-07-13 03:05:37,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:05:37,780 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-13 03:05:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-07-13 03:05:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-13 03:05:37,782 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) [2022-07-13 03:05:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-07-13 03:05:37,782 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-13 03:05:37,782 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-13 03:05:37,783 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:05:37,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-07-13 03:05:37,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:37,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:05:37,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:05:37,784 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:05:37,784 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:05:37,784 INFO L752 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 110#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 108#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 109#L13-3 assume !(main_~n~0#1 < 10); 105#L17-4 [2022-07-13 03:05:37,785 INFO L754 eck$LassoCheckResult]: Loop: 105#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 103#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 104#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 105#L17-4 [2022-07-13 03:05:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-07-13 03:05:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:37,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199281296] [2022-07-13 03:05:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:05:37,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:05:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:05:37,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199281296] [2022-07-13 03:05:37,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199281296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:05:37,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678886168] [2022-07-13 03:05:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:37,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:05:37,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:05:37,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:05:37,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 03:05:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:05:37,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:05:37,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:05:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:37,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:05:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:37,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678886168] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:05:37,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:05:37,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-13 03:05:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366161913] [2022-07-13 03:05:37,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:05:37,902 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:05:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2022-07-13 03:05:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:37,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834544961] [2022-07-13 03:05:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:37,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:37,908 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:37,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:05:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:05:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:05:38,020 INFO L87 Difference]: Start difference. First operand 8 states and 10 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) [2022-07-13 03:05:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:05:38,048 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-07-13 03:05:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:05:38,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2022-07-13 03:05:38,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:38,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2022-07-13 03:05:38,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:05:38,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:05:38,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-13 03:05:38,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:05:38,050 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:05:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-13 03:05:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-13 03:05:38,051 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) [2022-07-13 03:05:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-13 03:05:38,052 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:05:38,052 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:05:38,052 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:05:38,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-07-13 03:05:38,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:38,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:05:38,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:05:38,053 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-07-13 03:05:38,053 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:05:38,053 INFO L752 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 166#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 167#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 168#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 164#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 165#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 172#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 171#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 170#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 169#L13-3 assume !(main_~n~0#1 < 10); 161#L17-4 [2022-07-13 03:05:38,053 INFO L754 eck$LassoCheckResult]: Loop: 161#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 159#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 160#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 161#L17-4 [2022-07-13 03:05:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-07-13 03:05:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:38,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279846057] [2022-07-13 03:05:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:05:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:05:38,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279846057] [2022-07-13 03:05:38,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279846057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:05:38,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112305251] [2022-07-13 03:05:38,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:05:38,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:05:38,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:05:38,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:05:38,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 03:05:38,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:05:38,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:05:38,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:05:38,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:05:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:38,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:05:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:05:38,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112305251] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:05:38,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:05:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-13 03:05:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380536888] [2022-07-13 03:05:38,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:05:38,203 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:05:38,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2022-07-13 03:05:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:38,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818656899] [2022-07-13 03:05:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:05:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:05:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:05:38,269 INFO L87 Difference]: Start difference. First operand 14 states and 16 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) [2022-07-13 03:05:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:05:38,297 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-07-13 03:05:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:05:38,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2022-07-13 03:05:38,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:38,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2022-07-13 03:05:38,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:05:38,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:05:38,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-07-13 03:05:38,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:05:38,300 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-13 03:05:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-07-13 03:05:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 03:05:38,301 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) [2022-07-13 03:05:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-13 03:05:38,302 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-13 03:05:38,302 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-13 03:05:38,302 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:05:38,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-07-13 03:05:38,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 03:05:38,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:05:38,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:05:38,303 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-07-13 03:05:38,303 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:05:38,303 INFO L752 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 282#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 283#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 284#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 280#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 281#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 300#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 299#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 298#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 297#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 296#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 295#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 294#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 293#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 292#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 291#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 290#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 289#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 288#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 287#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 286#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 285#L13-3 assume !(main_~n~0#1 < 10); 277#L17-4 [2022-07-13 03:05:38,303 INFO L754 eck$LassoCheckResult]: Loop: 277#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 275#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 276#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 277#L17-4 [2022-07-13 03:05:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:38,303 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-07-13 03:05:38,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:38,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346783237] [2022-07-13 03:05:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:38,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2022-07-13 03:05:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:38,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272545291] [2022-07-13 03:05:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:05:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2022-07-13 03:05:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:05:38,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749704227] [2022-07-13 03:05:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:05:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:05:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:05:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:05:38,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:05:40,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:05:40 BoogieIcfgContainer [2022-07-13 03:05:40,754 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:05:40,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:05:40,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:05:40,754 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:05:40,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:05:36" (3/4) ... [2022-07-13 03:05:40,756 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:05:40,777 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:05:40,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:05:40,778 INFO L158 Benchmark]: Toolchain (without parser) took 4690.81ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 57.0MB in the beginning and 48.7MB in the end (delta: 8.3MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2022-07-13 03:05:40,779 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 60.8MB in the end (delta: 24.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:05:40,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.22ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 67.6MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:05:40,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.03ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 66.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:05:40,780 INFO L158 Benchmark]: Boogie Preprocessor took 12.66ms. Allocated memory is still 90.2MB. Free memory was 65.9MB in the beginning and 65.2MB in the end (delta: 743.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:05:40,780 INFO L158 Benchmark]: RCFGBuilder took 246.35ms. Allocated memory is still 90.2MB. Free memory was 65.0MB in the beginning and 55.8MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:05:40,780 INFO L158 Benchmark]: BuchiAutomizer took 4170.09ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 55.8MB in the beginning and 50.8MB in the end (delta: 5.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-07-13 03:05:40,781 INFO L158 Benchmark]: Witness Printer took 23.73ms. Allocated memory is still 123.7MB. Free memory was 50.8MB in the beginning and 48.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:05:40,783 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.14ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 60.8MB in the end (delta: 24.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.22ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 67.6MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.03ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 66.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.66ms. Allocated memory is still 90.2MB. Free memory was 65.9MB in the beginning and 65.2MB in the end (delta: 743.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.35ms. Allocated memory is still 90.2MB. Free memory was 65.0MB in the beginning and 55.8MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4170.09ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 55.8MB in the beginning and 50.8MB in the end (delta: 5.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 23.73ms. Allocated memory is still 123.7MB. Free memory was 50.8MB in the beginning and 48.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -8 * n + 19 * unknown-#length-unknown[a] and consists of 5 locations. 3 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 4.1s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn64 mio100 lsp65 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 136ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 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.CASTFunctionCallExpression@17929773=9, NULL=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7dac59f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@342f6bb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3818e9ea=0, NULL=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ce506a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@191ea8c5=0, i=9, NULL=0, n=10, a=2} - 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! [2022-07-13 03:05:40,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 03:05:41,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 03:05:41,235 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)