./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-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-dev-03d7b7b [2022-02-21 03:23:57,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:57,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:57,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:57,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:57,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:57,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:57,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:57,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:57,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:57,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:57,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:57,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:57,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:57,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:57,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:57,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:57,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:57,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:57,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:57,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:57,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:57,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:57,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:57,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:57,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:57,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:57,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:57,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:57,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:57,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:57,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:57,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:57,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:57,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:57,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:57,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:57,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:57,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:57,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:57,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:57,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:57,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:57,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:57,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:57,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:57,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:57,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:57,948 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:57,948 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:57,948 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:57,948 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:57,949 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:57,949 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:57,949 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:57,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:57,950 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:57,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:57,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:57,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:57,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:57,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:57,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:57,951 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:57,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:57,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:57,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:57,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:57,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:57,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:57,953 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:57,954 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-02-21 03:23:58,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:58,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:58,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:58,176 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:58,176 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:58,177 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-02-21 03:23:58,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2743181b6/f624f6fb33a44537b881cdfed65064ba/FLAG71d586fc1 [2022-02-21 03:23:58,598 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:58,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2022-02-21 03:23:58,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2743181b6/f624f6fb33a44537b881cdfed65064ba/FLAG71d586fc1 [2022-02-21 03:23:58,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2743181b6/f624f6fb33a44537b881cdfed65064ba [2022-02-21 03:23:58,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:58,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:58,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:58,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:58,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:58,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566f2957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58, skipping insertion in model container [2022-02-21 03:23:58,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:58,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:58,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:58,816 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:58,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:58,852 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:58,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58 WrapperNode [2022-02-21 03:23:58,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:58,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:58,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:58,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:58,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,882 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-02-21 03:23:58,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:58,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:58,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:58,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:58,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:58,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:58,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:58,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:58,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (1/1) ... [2022-02-21 03:23:58,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:58,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:58,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:23:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:23:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:58,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:23:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:23:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:23:59,044 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:59,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:59,173 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:59,178 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:59,178 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:23:59,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:59 BoogieIcfgContainer [2022-02-21 03:23:59,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:59,180 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:59,180 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:59,183 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:59,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:59,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:58" (1/3) ... [2022-02-21 03:23:59,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44f4a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:59, skipping insertion in model container [2022-02-21 03:23:59,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:59,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:58" (2/3) ... [2022-02-21 03:23:59,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44f4a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:59, skipping insertion in model container [2022-02-21 03:23:59,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:59,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:59" (3/3) ... [2022-02-21 03:23:59,186 INFO L388 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2022-02-21 03:23:59,249 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:59,249 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:59,249 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:59,249 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:59,249 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:59,249 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:59,250 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:59,250 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:59,262 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-02-21 03:23:59,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:23:59,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:59,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:59,281 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:59,282 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:59,282 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:59,282 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-02-21 03:23:59,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:23:59,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:59,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:59,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:59,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:59,291 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#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; 9#L13-3true [2022-02-21 03:23:59,292 INFO L793 eck$LassoCheckResult]: Loop: 9#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; 8#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; 9#L13-3true [2022-02-21 03:23:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:23:59,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:59,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580327623] [2022-02-21 03:23:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:59,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:59,412 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:23:59,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:59,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807718906] [2022-02-21 03:23:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:59,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:59,454 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:23:59,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:59,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622961925] [2022-02-21 03:23:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:59,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:59,508 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:59,724 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:59,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:59,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:59,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:59,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:59,726 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,726 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:59,726 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:59,726 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2022-02-21 03:23:59,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:59,726 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:59,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:59,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:00,061 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:00,064 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:00,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:00,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:00,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:00,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:00,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:00,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:00,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:00,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:00,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:00,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:00,162 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:24:00,163 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:24:00,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:00,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:00,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:00,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:00,180 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:00,197 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:24:00,198 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:00,199 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-02-21 03:24:00,233 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 [2022-02-21 03:24:00,253 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:24:00,265 INFO L390 LassoCheck]: Loop: "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;" "main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1;" [2022-02-21 03:24:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:00,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:24:00,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} 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; {21#unseeded} is VALID [2022-02-21 03:24:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:00,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* (- 8) |ULTIMATE.start_main_~n~0#1|) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|))))} 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; {47#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (< |ULTIMATE.start_main_~n~0#1| 10) (>= oldRank0 (+ (* |ULTIMATE.start_main_~n~0#1| (- 8)) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))))} is VALID [2022-02-21 03:24:00,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (< |ULTIMATE.start_main_~n~0#1| 10) (>= oldRank0 (+ (* |ULTIMATE.start_main_~n~0#1| (- 8)) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {39#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) |ULTIMATE.start_main_~n~0#1|) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|))))) unseeded)} is VALID [2022-02-21 03:24:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:00,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:24:00,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:00,442 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,447 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-02-21 03:24:00,448 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-02-21 03:24:00,521 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-02-21 03:24:00,522 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-02-21 03:24:00,522 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:00,522 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-02-21 03:24:00,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:00,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:00,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:00,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:24:00,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:00,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:00,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:00,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 37 transitions. [2022-02-21 03:24:00,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:00,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:00,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:00,542 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:24:00,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:00,547 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:00,547 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:24:00,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:00,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:00,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 37 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:00,557 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:00,557 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,557 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,569 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:00,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,569 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,570 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,570 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:00,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:00,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:00,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,576 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:00,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,576 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:00,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:00,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,577 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:00,580 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-02-21 03:24:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:24:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:00,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:00,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:24:00,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:00,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:00,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:00,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 12 transitions. [2022-02-21 03:24:00,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:00,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:24:00,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:24:00,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:00,587 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:24:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:24:00,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:00,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second 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-02-21 03:24:00,604 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second 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-02-21 03:24:00,606 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second 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-02-21 03:24:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:00,608 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:00,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:00,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:00,609 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 9 states and 12 transitions. [2022-02-21 03:24:00,609 INFO L87 Difference]: Start difference. First 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) Second operand 9 states and 12 transitions. [2022-02-21 03:24:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:00,609 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:00,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:00,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:00,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:00,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:00,610 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-02-21 03:24:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:24:00,612 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:00,612 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:00,612 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:00,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:00,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:00,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:00,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:00,613 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:00,613 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:00,613 INFO L791 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 91#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; 94#L13-3 assume !(main_~n~0#1 < 10); 89#L17-4 [2022-02-21 03:24:00,613 INFO L793 eck$LassoCheckResult]: Loop: 89#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 87#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; 88#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; 89#L17-4 [2022-02-21 03:24:00,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:00,614 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-02-21 03:24:00,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:00,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722851953] [2022-02-21 03:24:00,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {116#true} is VALID [2022-02-21 03:24:00,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} 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; {118#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:00,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~n~0#1 < 10); {117#false} is VALID [2022-02-21 03:24:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:00,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:00,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722851953] [2022-02-21 03:24:00,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722851953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:00,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:00,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:24:00,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748709270] [2022-02-21 03:24:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:00,662 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:24:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2022-02-21 03:24:00,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:00,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358878387] [2022-02-21 03:24:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:00,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:00,691 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:00,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:00,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:24:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:24:00,815 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-02-21 03:24:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:00,830 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:24:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:24:00,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:24:00,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:00,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2022-02-21 03:24:00,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:00,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2022-02-21 03:24:00,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:00,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:00,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-02-21 03:24:00,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:00,837 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:24:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-02-21 03:24:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:24:00,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:00,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second 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-02-21 03:24:00,839 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second 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-02-21 03:24:00,839 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second 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-02-21 03:24:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:00,839 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:24:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:24:00,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:00,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:00,842 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 9 states and 11 transitions. [2022-02-21 03:24:00,842 INFO L87 Difference]: Start difference. First 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) Second operand 9 states and 11 transitions. [2022-02-21 03:24:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:00,843 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:24:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:24:00,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:00,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:00,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:00,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:00,847 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-02-21 03:24:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:24:00,848 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:00,848 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:00,848 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:00,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:24:00,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:00,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:00,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:00,851 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:24:00,851 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:00,851 INFO L791 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 134#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; 137#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; 135#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; 136#L13-3 assume !(main_~n~0#1 < 10); 132#L17-4 [2022-02-21 03:24:00,852 INFO L793 eck$LassoCheckResult]: Loop: 132#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 130#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; 131#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; 132#L17-4 [2022-02-21 03:24:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-02-21 03:24:00,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:00,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220052819] [2022-02-21 03:24:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2022-02-21 03:24:00,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} 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; {161#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:00,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#(= |ULTIMATE.start_main_~n~0#1| 0)} 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; {161#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:00,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {161#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:24:00,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(main_~n~0#1 < 10); {160#false} is VALID [2022-02-21 03:24:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:00,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:00,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220052819] [2022-02-21 03:24:00,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220052819] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:00,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108072406] [2022-02-21 03:24:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:00,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:00,900 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-02-21 03:24:00,947 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-02-21 03:24:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:00,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:00,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2022-02-21 03:24:01,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} 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; {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:01,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} 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; {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:01,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:24:01,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(main_~n~0#1 < 10); {160#false} is VALID [2022-02-21 03:24:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:01,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:01,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(< |ULTIMATE.start_main_~n~0#1| 10)} assume !(main_~n~0#1 < 10); {160#false} is VALID [2022-02-21 03:24:01,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#(< |ULTIMATE.start_main_~n~0#1| 9)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {179#(< |ULTIMATE.start_main_~n~0#1| 10)} is VALID [2022-02-21 03:24:01,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#(< |ULTIMATE.start_main_~n~0#1| 9)} 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; {183#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:24:01,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} 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; {183#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:24:01,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2022-02-21 03:24:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:01,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108072406] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:01,034 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:01,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 03:24:01,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455097170] [2022-02-21 03:24:01,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:01,035 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:24:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2022-02-21 03:24:01,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:01,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488334274] [2022-02-21 03:24:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,047 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:01,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:24:01,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:24:01,136 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-02-21 03:24:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:01,172 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:24:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:24:01,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:24:01,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:01,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2022-02-21 03:24:01,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:01,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:24:01,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:01,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:01,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-02-21 03:24:01,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:01,184 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:24:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-02-21 03:24:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:24:01,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:01,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second 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-02-21 03:24:01,186 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second 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-02-21 03:24:01,186 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second 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-02-21 03:24:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:01,186 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:24:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:24:01,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:01,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:01,187 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 14 states and 16 transitions. [2022-02-21 03:24:01,187 INFO L87 Difference]: Start difference. First 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) Second operand 14 states and 16 transitions. [2022-02-21 03:24:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:01,188 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:24:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:24:01,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:01,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:01,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:01,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:01,188 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-02-21 03:24:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:24:01,189 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:24:01,189 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:24:01,189 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:01,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:24:01,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:01,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:01,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:01,190 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-02-21 03:24:01,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:01,190 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#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; 213#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; 214#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; 215#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; 211#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; 212#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; 219#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; 218#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; 217#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; 216#L13-3 assume !(main_~n~0#1 < 10); 208#L17-4 [2022-02-21 03:24:01,190 INFO L793 eck$LassoCheckResult]: Loop: 208#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 206#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; 207#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; 208#L17-4 [2022-02-21 03:24:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-02-21 03:24:01,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:01,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051417280] [2022-02-21 03:24:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:01,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {251#true} is VALID [2022-02-21 03:24:01,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} 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; {253#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:01,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(= |ULTIMATE.start_main_~n~0#1| 0)} 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; {253#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:01,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:24:01,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} 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; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:24:01,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:24:01,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} 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; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:24:01,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:24:01,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 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; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:24:01,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} is VALID [2022-02-21 03:24:01,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} assume !(main_~n~0#1 < 10); {252#false} is VALID [2022-02-21 03:24:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:01,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:01,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051417280] [2022-02-21 03:24:01,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051417280] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:01,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86631133] [2022-02-21 03:24:01,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:24:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:01,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:01,255 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-02-21 03:24:01,256 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-02-21 03:24:01,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:24:01,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:24:01,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:01,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:01,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {251#true} is VALID [2022-02-21 03:24:01,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} 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; {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:01,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} 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; {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:24:01,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:24:01,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} 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; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:24:01,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:24:01,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} 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; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:24:01,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:24:01,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 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; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:24:01,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} is VALID [2022-02-21 03:24:01,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} assume !(main_~n~0#1 < 10); {252#false} is VALID [2022-02-21 03:24:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:01,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:01,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#(< |ULTIMATE.start_main_~n~0#1| 10)} assume !(main_~n~0#1 < 10); {252#false} is VALID [2022-02-21 03:24:01,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(< |ULTIMATE.start_main_~n~0#1| 9)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {292#(< |ULTIMATE.start_main_~n~0#1| 10)} is VALID [2022-02-21 03:24:01,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(< |ULTIMATE.start_main_~n~0#1| 9)} 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#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:24:01,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#(< |ULTIMATE.start_main_~n~0#1| 8)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {296#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:24:01,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#(< |ULTIMATE.start_main_~n~0#1| 8)} 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; {303#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-21 03:24:01,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#(< |ULTIMATE.start_main_~n~0#1| 7)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {303#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-21 03:24:01,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#(< |ULTIMATE.start_main_~n~0#1| 7)} 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; {310#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-21 03:24:01,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {317#(< |ULTIMATE.start_main_~n~0#1| 6)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {310#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-21 03:24:01,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#(< |ULTIMATE.start_main_~n~0#1| 6)} 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; {317#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-21 03:24:01,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} 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; {317#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-21 03:24:01,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {251#true} is VALID [2022-02-21 03:24:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:01,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86631133] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:01,512 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:01,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-02-21 03:24:01,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751212340] [2022-02-21 03:24:01,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:01,513 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:24:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2022-02-21 03:24:01,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:01,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112475565] [2022-02-21 03:24:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,524 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:01,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:24:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:24:01,607 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-02-21 03:24:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:01,674 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-21 03:24:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:24:01,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:24:01,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:01,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2022-02-21 03:24:01,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:01,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:24:01,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:01,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:01,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-02-21 03:24:01,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:01,698 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:24:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-02-21 03:24:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-21 03:24:01,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:01,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 28 transitions. Second 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-02-21 03:24:01,699 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 28 transitions. Second 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-02-21 03:24:01,700 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second 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-02-21 03:24:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:01,700 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-21 03:24:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:24:01,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:01,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:01,701 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 26 states and 28 transitions. [2022-02-21 03:24:01,701 INFO L87 Difference]: Start difference. First 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) Second operand 26 states and 28 transitions. [2022-02-21 03:24:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:01,702 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-21 03:24:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:24:01,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:01,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:01,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:01,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:01,703 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-02-21 03:24:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:24:01,704 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:24:01,704 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:24:01,704 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:01,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:24:01,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:01,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:01,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:01,705 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-02-21 03:24:01,705 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:01,705 INFO L791 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 356#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; 359#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; 360#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; 361#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; 357#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; 358#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; 377#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; 376#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; 375#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; 374#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; 373#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; 372#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; 371#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; 370#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; 369#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; 368#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; 367#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; 366#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; 365#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; 364#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; 363#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; 362#L13-3 assume !(main_~n~0#1 < 10); 354#L17-4 [2022-02-21 03:24:01,705 INFO L793 eck$LassoCheckResult]: Loop: 354#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 352#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; 353#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; 354#L17-4 [2022-02-21 03:24:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-02-21 03:24:01,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:01,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719509646] [2022-02-21 03:24:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,756 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2022-02-21 03:24:01,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:01,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51709930] [2022-02-21 03:24:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,766 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2022-02-21 03:24:01,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:01,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949316060] [2022-02-21 03:24:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:01,834 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:04,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:04 BoogieIcfgContainer [2022-02-21 03:24:04,514 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:04,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:04,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:04,515 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:04,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:59" (3/4) ... [2022-02-21 03:24:04,517 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:24:04,541 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:24:04,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:04,542 INFO L158 Benchmark]: Toolchain (without parser) took 5919.64ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 51.1MB in the beginning and 77.2MB in the end (delta: -26.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:24:04,542 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:04,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.96ms. Allocated memory is still 86.0MB. Free memory was 50.9MB in the beginning and 64.0MB in the end (delta: -13.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-02-21 03:24:04,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.91ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 62.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:04,543 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 61.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:04,544 INFO L158 Benchmark]: RCFGBuilder took 260.70ms. Allocated memory is still 86.0MB. Free memory was 61.2MB in the beginning and 51.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:24:04,544 INFO L158 Benchmark]: BuchiAutomizer took 5333.43ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 51.0MB in the beginning and 79.3MB in the end (delta: -28.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2022-02-21 03:24:04,544 INFO L158 Benchmark]: Witness Printer took 27.29ms. Allocated memory is still 125.8MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:04,546 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.96ms. Allocated memory is still 86.0MB. Free memory was 50.9MB in the beginning and 64.0MB in the end (delta: -13.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.91ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 62.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 61.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.70ms. Allocated memory is still 86.0MB. Free memory was 61.2MB in the beginning and 51.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5333.43ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 51.0MB in the beginning and 79.3MB in the end (delta: -28.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 27.29ms. Allocated memory is still 125.8MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.0MB). 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 5.2s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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 26 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 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: 133ms VariablesStem: 3 VariablesLoop: 4 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.CASTFunctionCallExpression@6c3421c=4, NULL=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25524888=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1b27a74d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@44611d5f=0, NULL=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64bc35c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1f694314=0, i=4, 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-02-21 03:24:04,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:04,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:04,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)