./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --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-memory-alloca/java_Continue1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:46,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:46,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:46,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:46,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:46,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:46,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:46,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:46,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:46,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:46,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:46,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:46,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:46,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:46,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:46,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:46,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:46,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:46,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:46,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:46,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:46,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:46,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:46,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:46,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:46,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:46,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:46,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:46,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:46,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:46,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:46,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:46,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:46,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:46,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:46,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:46,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:46,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:46,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:46,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:46,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:46,670 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:32:46,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:46,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:46,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:46,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:46,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:46,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:46,709 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:46,709 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:46,710 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:46,710 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:46,710 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:46,710 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:46,710 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:46,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:46,711 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:46,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:46,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:46,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:46,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:46,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:46,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:46,712 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:46,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:46,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:46,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:46,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:46,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:46,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:46,714 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:46,714 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 -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2022-02-21 03:32:46,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:46,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:46,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:46,951 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:46,951 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:46,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-02-21 03:32:47,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964906d83/0de7456387c7401abca7d9ada4e32568/FLAG5871e9bde [2022-02-21 03:32:47,435 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:47,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-02-21 03:32:47,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964906d83/0de7456387c7401abca7d9ada4e32568/FLAG5871e9bde [2022-02-21 03:32:47,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964906d83/0de7456387c7401abca7d9ada4e32568 [2022-02-21 03:32:47,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:47,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:47,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:47,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:47,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:47,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27776928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47, skipping insertion in model container [2022-02-21 03:32:47,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:47,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:47,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:47,819 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:47,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:47,900 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:47,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47 WrapperNode [2022-02-21 03:32:47,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:47,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:47,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:47,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:47,910 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:32:47" (1/1) ... [2022-02-21 03:32:47,930 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:32:47" (1/1) ... [2022-02-21 03:32:47,957 INFO L137 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2022-02-21 03:32:47,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:47,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:47,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:47,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:47,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:47,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:47,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:47,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:47,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (1/1) ... [2022-02-21 03:32:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:48,024 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:32:48,049 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:32:48,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:48,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:48,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:48,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:48,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:48,151 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:48,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:48,269 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:48,275 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:48,275 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:32:48,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:48 BoogieIcfgContainer [2022-02-21 03:32:48,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:48,278 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:48,279 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:48,282 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:48,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:48,283 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:47" (1/3) ... [2022-02-21 03:32:48,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@652afe64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:48, skipping insertion in model container [2022-02-21 03:32:48,285 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:48,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:47" (2/3) ... [2022-02-21 03:32:48,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@652afe64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:48, skipping insertion in model container [2022-02-21 03:32:48,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:48,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:48" (3/3) ... [2022-02-21 03:32:48,287 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2022-02-21 03:32:48,323 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:48,323 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:48,323 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:48,323 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:48,323 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:48,324 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:48,324 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:48,324 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:48,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:48,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:48,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:48,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:48,365 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:48,365 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:48,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:48,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:48,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:48,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:48,368 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:48,368 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:48,390 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 5#L552-3true [2022-02-21 03:32:48,390 INFO L793 eck$LassoCheckResult]: Loop: 5#L552-3true goto; 8#L554-1true call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10#L552-1true assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11#L554true assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 5#L552-3true [2022-02-21 03:32:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:32:48,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:48,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682691626] [2022-02-21 03:32:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2022-02-21 03:32:48,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:48,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646620383] [2022-02-21 03:32:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:48,721 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2022-02-21 03:32:48,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:48,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192422845] [2022-02-21 03:32:48,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:48,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {18#true} is VALID [2022-02-21 03:32:48,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {20#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:48,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} goto; {20#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:48,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {21#(and (= |ULTIMATE.start_main_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem4#1| 0))} is VALID [2022-02-21 03:32:48,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#(and (= |ULTIMATE.start_main_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem4#1| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {22#(<= |ULTIMATE.start_main_#t~mem7#1| 10)} is VALID [2022-02-21 03:32:48,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#(<= |ULTIMATE.start_main_#t~mem7#1| 10)} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {19#false} is VALID [2022-02-21 03:32:48,931 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:32:48,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:48,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192422845] [2022-02-21 03:32:48,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192422845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:48,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:48,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:48,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890998931] [2022-02-21 03:32:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:49,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:32:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:32:49,130 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:32:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:49,186 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:32:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:32:49,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:32:49,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:49,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-02-21 03:32:49,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:49,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2022-02-21 03:32:49,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:49,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:32:49,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2022-02-21 03:32:49,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:49,207 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:32:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2022-02-21 03:32:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:32:49,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:49,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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:32:49,227 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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:32:49,228 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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:32:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:49,229 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:32:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:32:49,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:49,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:49,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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 10 states and 11 transitions. [2022-02-21 03:32:49,231 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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 10 states and 11 transitions. [2022-02-21 03:32:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:49,232 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:32:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:32:49,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:49,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:49,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:49,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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:32:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-02-21 03:32:49,235 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:32:49,235 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:32:49,236 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:49,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:32:49,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:49,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:49,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:49,237 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:49,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:49,237 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 37#L552-3 goto; 38#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 41#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 42#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2022-02-21 03:32:49,238 INFO L793 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 46#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 44#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2022-02-21 03:32:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-02-21 03:32:49,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:49,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142430178] [2022-02-21 03:32:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,279 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-02-21 03:32:49,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:49,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155816522] [2022-02-21 03:32:49,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,313 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2022-02-21 03:32:49,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:49,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323040903] [2022-02-21 03:32:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:49,378 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:49,852 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:49,852 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:49,852 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:49,852 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:49,852 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:49,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:49,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:49,853 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:49,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2022-02-21 03:32:49,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:49,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:49,870 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:32:49,876 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:32:49,879 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:32:50,129 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:32:50,134 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:32:50,136 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:32:50,139 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:32:50,143 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:32:50,146 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:32:50,149 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:32:50,152 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:32:50,155 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:32:50,157 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:32:50,161 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:32:50,164 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:32:50,166 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:32:50,558 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:50,561 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,564 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:32:50,568 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:32:50,584 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:32:50,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:50,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:50,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:50,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,637 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:32:50,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,639 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:32:50,646 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:32:50,647 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:32:50,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:50,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:50,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:50,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:32:50,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:32:50,712 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:32:50,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:50,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:50,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:50,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:32:50,775 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:32:50,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:50,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:50,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:50,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:32:50,841 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:32:50,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:50,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:50,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:50,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:32:50,912 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:32:50,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:50,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:50,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:50,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:50,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:50,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:50,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:32:50,975 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:32:50,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:50,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:50,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:50,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:50,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:50,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:51,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,023 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:32:51,025 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:32:51,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:51,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:51,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:51,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:51,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:51,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:51,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:51,063 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:32:51,064 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:32:51,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,067 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:51,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:51,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:32:51,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:51,137 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:51,137 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2022-02-21 03:32:51,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,224 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-02-21 03:32:51,230 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1;" [2022-02-21 03:32:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:51,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {76#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {76#unseeded} is VALID [2022-02-21 03:32:51,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {76#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {76#unseeded} is VALID [2022-02-21 03:32:51,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {76#unseeded} goto; {76#unseeded} is VALID [2022-02-21 03:32:51,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {76#unseeded} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {76#unseeded} is VALID [2022-02-21 03:32:51,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {76#unseeded} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {76#unseeded} is VALID [2022-02-21 03:32:51,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {76#unseeded} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {76#unseeded} is VALID [2022-02-21 03:32:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:32:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:51,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-02-21 03:32:51,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {79#(>= oldRank0 (+ 19 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|))))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {79#(>= oldRank0 (+ 19 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|))))} is VALID [2022-02-21 03:32:51,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#(>= oldRank0 (+ 19 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|))))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {162#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1|) (<= (+ (div (+ oldRank0 (- 19)) (- 2)) 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:32:51,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1|) (<= (+ (div (+ oldRank0 (- 19)) (- 2)) 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {139#(or (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:32:51,493 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:32:51,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:51,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,506 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:32:51,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 17 states and 20 transitions. Complement of second has 6 states. [2022-02-21 03:32:51,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:51,578 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:51,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. cyclomatic complexity: 2 [2022-02-21 03:32:51,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:51,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:32:51,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:51,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,594 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 11 transitions. cyclomatic complexity: 2 [2022-02-21 03:32:51,596 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:51,596 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:51,598 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:51,598 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:51,601 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:51,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:51,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:51,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:51,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:32:51,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:51,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:51,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 8 letters. Loop has 4 letters. [2022-02-21 03:32:51,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:51,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:32:51,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 17 letters. Loop has 17 letters. [2022-02-21 03:32:51,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:32:51,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:51,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 letters. Loop has 10 letters. [2022-02-21 03:32:51,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:51,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:51,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 4 letters. [2022-02-21 03:32:51,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:51,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:51,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:51,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:51,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 8 letters. Loop has 3 letters. [2022-02-21 03:32:51,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:32:51,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:51,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 letters. Loop has 4 letters. [2022-02-21 03:32:51,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:51,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:51,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 7 letters. Loop has 3 letters. [2022-02-21 03:32:51,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:51,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:51,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:32:51,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:51,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:51,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 8 letters. Loop has 4 letters. [2022-02-21 03:32:51,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:51,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:51,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 letters. Loop has 4 letters. [2022-02-21 03:32:51,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:51,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:51,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 letters. Loop has 4 letters. [2022-02-21 03:32:51,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:51,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:32:51,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 4 letters. [2022-02-21 03:32:51,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:32:51,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,623 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:32:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:32:51,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:32:51,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:51,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:51,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:51,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:51,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:51,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:32:51,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:51,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:32:51,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-02-21 03:32:51,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:51,628 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:32:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-02-21 03:32:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:32:51,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:51,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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:32:51,629 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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:32:51,630 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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:32:51,630 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:51,632 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:32:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:32:51,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:51,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:51,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 17 states and 20 transitions. [2022-02-21 03:32:51,633 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 17 states and 20 transitions. [2022-02-21 03:32:51,633 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:51,634 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:32:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:32:51,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:51,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:51,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:51,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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:32:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:32:51,636 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:32:51,636 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:32:51,636 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:51,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:32:51,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:51,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:51,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:51,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-02-21 03:32:51,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:51,637 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 200#L552-3 goto; 207#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 206#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 205#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 204#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 198#L552-1 [2022-02-21 03:32:51,637 INFO L793 eck$LassoCheckResult]: Loop: 198#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 201#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 194#L552-3 goto; 195#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 198#L552-1 [2022-02-21 03:32:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2022-02-21 03:32:51,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:51,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790544060] [2022-02-21 03:32:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:51,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:51,669 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:51,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2022-02-21 03:32:51,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:51,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770861532] [2022-02-21 03:32:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:51,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:51,686 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2022-02-21 03:32:51,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:51,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872679319] [2022-02-21 03:32:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {293#true} is VALID [2022-02-21 03:32:51,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {295#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:51,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} goto; {295#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:51,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {295#(= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {296#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem4#1|)) 0) (= |ULTIMATE.start_main_#t~mem4#1| 0))} is VALID [2022-02-21 03:32:51,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {296#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (* (- 1) |ULTIMATE.start_main_#t~mem4#1|)) 0) (= |ULTIMATE.start_main_#t~mem4#1| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {297#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| 1))} is VALID [2022-02-21 03:32:51,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| 1))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {298#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} is VALID [2022-02-21 03:32:51,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {298#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} is VALID [2022-02-21 03:32:51,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {299#(<= |ULTIMATE.start_main_#t~mem7#1| 2)} is VALID [2022-02-21 03:32:51,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(<= |ULTIMATE.start_main_#t~mem7#1| 2)} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {294#false} is VALID [2022-02-21 03:32:51,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} goto; {294#false} is VALID [2022-02-21 03:32:51,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {294#false} is VALID [2022-02-21 03:32:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:51,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:51,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872679319] [2022-02-21 03:32:51,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872679319] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:51,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729412927] [2022-02-21 03:32:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:51,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,801 INFO L229 MonitoredProcess]: Starting monitored process 11 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:32:51,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:51,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:32:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:32:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:51,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:51,919 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-02-21 03:32:51,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-02-21 03:32:51,940 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-02-21 03:32:51,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-02-21 03:32:51,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:32:51,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:32:52,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:32:52,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-02-21 03:32:52,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-02-21 03:32:52,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:32:52,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-02-21 03:32:52,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-21 03:32:52,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {293#true} is VALID [2022-02-21 03:32:52,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {306#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:32:52,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} goto; {306#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:32:52,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {306#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {306#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:32:52,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {306#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {316#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:32:52,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {316#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:32:52,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {316#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:32:52,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {299#(<= |ULTIMATE.start_main_#t~mem7#1| 2)} is VALID [2022-02-21 03:32:52,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(<= |ULTIMATE.start_main_#t~mem7#1| 2)} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {294#false} is VALID [2022-02-21 03:32:52,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} goto; {294#false} is VALID [2022-02-21 03:32:52,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {294#false} is VALID [2022-02-21 03:32:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:52,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:52,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {294#false} is VALID [2022-02-21 03:32:52,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} goto; {294#false} is VALID [2022-02-21 03:32:52,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#(<= |ULTIMATE.start_main_#t~mem7#1| 10)} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {294#false} is VALID [2022-02-21 03:32:52,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {341#(<= |ULTIMATE.start_main_#t~mem7#1| 10)} is VALID [2022-02-21 03:32:52,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {345#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} is VALID [2022-02-21 03:32:52,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {345#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} is VALID [2022-02-21 03:32:52,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {355#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {345#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} is VALID [2022-02-21 03:32:52,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {355#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {355#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} is VALID [2022-02-21 03:32:52,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} goto; {355#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} is VALID [2022-02-21 03:32:52,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {355#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} is VALID [2022-02-21 03:32:52,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {293#true} is VALID [2022-02-21 03:32:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:52,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729412927] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:52,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:52,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-02-21 03:32:52,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160581945] [2022-02-21 03:32:52,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:52,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:32:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:32:52,554 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:52,711 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-21 03:32:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:32:52,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:52,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2022-02-21 03:32:52,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:52,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2022-02-21 03:32:52,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:52,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:52,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2022-02-21 03:32:52,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:52,742 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-21 03:32:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2022-02-21 03:32:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 03:32:52,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:52,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 26 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,743 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 26 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,744 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,745 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:52,748 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:32:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:32:52,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:52,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:52,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 26 transitions. [2022-02-21 03:32:52,751 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 26 transitions. [2022-02-21 03:32:52,752 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:52,754 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:32:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:32:52,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:52,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:52,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:52,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-21 03:32:52,761 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-21 03:32:52,762 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-21 03:32:52,762 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:52,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:32:52,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:52,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,764 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2022-02-21 03:32:52,765 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:52,765 INFO L791 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 413#L552-3 goto; 422#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 421#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 417#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 409#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 410#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 416#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 411#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 412#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 426#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 425#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 424#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 423#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 419#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 414#L552-1 [2022-02-21 03:32:52,766 INFO L793 eck$LassoCheckResult]: Loop: 414#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 415#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 405#L552-3 goto; 406#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 414#L552-1 [2022-02-21 03:32:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 4 times [2022-02-21 03:32:52,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59381348] [2022-02-21 03:32:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,866 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2022-02-21 03:32:52,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724914061] [2022-02-21 03:32:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,892 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 2 times [2022-02-21 03:32:52,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783964669] [2022-02-21 03:32:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {558#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {558#true} is VALID [2022-02-21 03:32:53,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {560#(and (= |ULTIMATE.start_main_~c~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {560#(and (= |ULTIMATE.start_main_~c~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} goto; {560#(and (= |ULTIMATE.start_main_~c~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {560#(and (= |ULTIMATE.start_main_~c~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {561#(and (= |ULTIMATE.start_main_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_#t~mem4#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {561#(and (= |ULTIMATE.start_main_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| |ULTIMATE.start_main_#t~mem4#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {562#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 1)))} is VALID [2022-02-21 03:32:53,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {562#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 1)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {563#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 1)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 1)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {563#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 1)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 1)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {564#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 2)))} is VALID [2022-02-21 03:32:53,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 2)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {565#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 2)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 2)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {565#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 2)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 2)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {566#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 3)))} is VALID [2022-02-21 03:32:53,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {566#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 3)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {567#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 3)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {567#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 3)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {567#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 3)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 3)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {568#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 4)))} is VALID [2022-02-21 03:32:53,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {568#(and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) |ULTIMATE.start_main_#t~mem7#1|) 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 4)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {569#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 4)))} is VALID [2022-02-21 03:32:53,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {569#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 4)))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {569#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 4)))} is VALID [2022-02-21 03:32:53,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (+ |ULTIMATE.start_main_~c~0#1.offset| 4)))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {570#(and (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 5)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} is VALID [2022-02-21 03:32:53,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {570#(and (<= |ULTIMATE.start_main_#t~mem7#1| (+ |ULTIMATE.start_main_~c~0#1.offset| 5)) (= |ULTIMATE.start_main_~c~0#1.offset| 0))} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {559#false} is VALID [2022-02-21 03:32:53,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} goto; {559#false} is VALID [2022-02-21 03:32:53,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {559#false} is VALID [2022-02-21 03:32:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:53,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:53,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783964669] [2022-02-21 03:32:53,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783964669] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:53,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011049659] [2022-02-21 03:32:53,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:32:53,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:53,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:53,164 INFO L229 MonitoredProcess]: Starting monitored process 12 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:32:53,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:32:53,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:32:53,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:32:53,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-21 03:32:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:53,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:53,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-02-21 03:32:53,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:32:53,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:32:53,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-21 03:32:53,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:32:53,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:32:53,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:32:53,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:32:53,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-21 03:32:53,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {558#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {558#true} is VALID [2022-02-21 03:32:53,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {577#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:53,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} goto; {577#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:53,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {577#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} is VALID [2022-02-21 03:32:53,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {577#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {587#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} is VALID [2022-02-21 03:32:53,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {587#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} is VALID [2022-02-21 03:32:53,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {587#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} is VALID [2022-02-21 03:32:53,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 1)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {597#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 2)} is VALID [2022-02-21 03:32:53,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 2)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {597#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 2)} is VALID [2022-02-21 03:32:53,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 2)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {597#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 2)} is VALID [2022-02-21 03:32:53,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 2)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {607#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 3)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {607#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 3)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {607#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 3)} is VALID [2022-02-21 03:32:53,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 3)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {617#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 4)} is VALID [2022-02-21 03:32:53,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {617#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 4)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {617#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 4)} is VALID [2022-02-21 03:32:53,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 4)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {617#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 4)} is VALID [2022-02-21 03:32:53,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {617#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 4)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {627#(<= |ULTIMATE.start_main_#t~mem7#1| 5)} is VALID [2022-02-21 03:32:53,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {627#(<= |ULTIMATE.start_main_#t~mem7#1| 5)} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {559#false} is VALID [2022-02-21 03:32:53,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} goto; {559#false} is VALID [2022-02-21 03:32:53,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {559#false} is VALID [2022-02-21 03:32:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:53,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:54,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {559#false} is VALID [2022-02-21 03:32:54,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} goto; {559#false} is VALID [2022-02-21 03:32:54,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {643#(<= |ULTIMATE.start_main_#t~mem7#1| 10)} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {559#false} is VALID [2022-02-21 03:32:54,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {647#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {643#(<= |ULTIMATE.start_main_#t~mem7#1| 10)} is VALID [2022-02-21 03:32:54,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {647#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {647#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} is VALID [2022-02-21 03:32:54,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {647#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {647#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} is VALID [2022-02-21 03:32:54,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {647#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 9)} is VALID [2022-02-21 03:32:54,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {657#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} is VALID [2022-02-21 03:32:54,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {657#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} is VALID [2022-02-21 03:32:54,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 7)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {657#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 8)} is VALID [2022-02-21 03:32:54,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {667#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 7)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {667#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 7)} is VALID [2022-02-21 03:32:54,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {667#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 7)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {667#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 7)} is VALID [2022-02-21 03:32:54,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 6)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {667#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 7)} is VALID [2022-02-21 03:32:54,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 6)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {677#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 6)} is VALID [2022-02-21 03:32:54,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 6)} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {677#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 6)} is VALID [2022-02-21 03:32:54,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {687#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 5)} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {677#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 6)} is VALID [2022-02-21 03:32:54,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {687#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 5)} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {687#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 5)} is VALID [2022-02-21 03:32:54,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 5)} goto; {687#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 5)} is VALID [2022-02-21 03:32:54,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {687#(<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 5)} is VALID [2022-02-21 03:32:54,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {558#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {558#true} is VALID [2022-02-21 03:32:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:54,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011049659] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:54,357 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:54,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2022-02-21 03:32:54,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959592690] [2022-02-21 03:32:54,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:54,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:32:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=382, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:32:54,439 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:54,679 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-21 03:32:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-21 03:32:54,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:54,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2022-02-21 03:32:54,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:54,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 44 transitions. [2022-02-21 03:32:54,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:54,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:54,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2022-02-21 03:32:54,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:54,734 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-02-21 03:32:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2022-02-21 03:32:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-21 03:32:54,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:54,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 44 transitions. Second operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,737 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 44 transitions. Second operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,737 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,738 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:54,740 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-02-21 03:32:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-02-21 03:32:54,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:54,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:54,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states and 44 transitions. [2022-02-21 03:32:54,741 INFO L87 Difference]: Start difference. First operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states and 44 transitions. [2022-02-21 03:32:54,742 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:54,744 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-02-21 03:32:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-02-21 03:32:54,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:54,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:54,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:54,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-02-21 03:32:54,746 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-02-21 03:32:54,746 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-02-21 03:32:54,746 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:32:54,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-02-21 03:32:54,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:54,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:54,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:54,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2022-02-21 03:32:54,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:54,748 INFO L791 eck$LassoCheckResult]: Stem: 765#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 771#L552-3 goto; 781#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 780#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 775#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 767#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 768#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 802#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 769#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 770#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 774#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 776#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 801#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 800#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 799#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 798#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 797#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 796#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 795#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 794#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 793#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 792#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 791#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 790#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 789#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 788#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 787#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 786#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 785#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 784#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 783#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 782#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 778#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 772#L552-1 [2022-02-21 03:32:54,748 INFO L793 eck$LassoCheckResult]: Loop: 772#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 773#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 761#L552-3 goto; 762#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 772#L552-1 [2022-02-21 03:32:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 5 times [2022-02-21 03:32:54,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836405124] [2022-02-21 03:32:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,881 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2022-02-21 03:32:54,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674735099] [2022-02-21 03:32:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,896 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 3 times [2022-02-21 03:32:54,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:54,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683213425] [2022-02-21 03:32:54,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:54,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:01,812 WARN L228 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 203 DAG size of output: 165 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-02-21 03:33:02,003 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:02,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:02,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:02,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:02,003 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:02,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:02,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:02,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration5_Lasso [2022-02-21 03:33:02,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:02,004 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:02,006 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:33:02,009 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:33:02,012 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:33:02,014 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:33:02,016 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:33:02,019 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:33:02,021 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:33:02,023 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:33:02,025 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:33:02,027 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:33:02,030 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:33:02,312 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:33:02,314 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:33:02,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:02,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:02,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:02,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:33:02,687 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:33:02,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:02,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:02,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:02,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:02,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:33:02,714 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:33:02,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:02,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:02,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,746 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:02,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:33:02,752 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:33:02,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:02,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:02,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:02,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,781 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:02,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:33:02,783 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:33:02,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:02,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:02,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:02,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,810 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:02,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:33:02,813 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:33:02,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:02,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:02,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,842 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:02,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:33:02,846 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:33:02,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:02,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:02,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:02,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,890 INFO L229 MonitoredProcess]: Starting monitored process 19 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:33:02,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:33:02,893 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:33:02,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:02,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:02,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:02,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,951 INFO L229 MonitoredProcess]: Starting monitored process 20 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:33:02,962 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:33:02,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:33:02,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:02,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:02,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:02,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:02,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:02,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:02,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:02,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:33:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:02,988 INFO L229 MonitoredProcess]: Starting monitored process 21 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:33:02,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:33:02,994 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:33:03,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:03,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:03,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:03,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:33:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,020 INFO L229 MonitoredProcess]: Starting monitored process 22 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:33:03,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:33:03,031 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:33:03,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,059 INFO L229 MonitoredProcess]: Starting monitored process 23 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:33:03,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:33:03,061 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:33:03,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:03,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,089 INFO L229 MonitoredProcess]: Starting monitored process 24 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:33:03,098 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:33:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:33:03,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:33:03,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,125 INFO L229 MonitoredProcess]: Starting monitored process 25 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:33:03,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:33:03,128 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:33:03,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:03,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,175 INFO L229 MonitoredProcess]: Starting monitored process 26 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:33:03,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:33:03,177 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:33:03,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:33:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,204 INFO L229 MonitoredProcess]: Starting monitored process 27 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:33:03,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:33:03,206 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:33:03,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:33:03,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,238 INFO L229 MonitoredProcess]: Starting monitored process 28 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:33:03,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:33:03,241 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:33:03,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:03,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:33:03,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,299 INFO L229 MonitoredProcess]: Starting monitored process 29 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:33:03,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:33:03,301 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:33:03,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:03,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:03,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:03,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:03,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:03,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:03,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:03,322 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:33:03,322 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:33:03,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:03,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:03,324 INFO L229 MonitoredProcess]: Starting monitored process 30 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:33:03,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:33:03,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:03,332 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:33:03,332 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:03,332 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4#1) = -41*ULTIMATE.start_main_#t~mem4#1 + 790 Supporting invariants [41*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 - 40*ULTIMATE.start_main_#t~mem4#1 >= 0] [2022-02-21 03:33:03,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:33:03,396 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2022-02-21 03:33:03,403 INFO L390 LassoCheck]: Loop: "assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1;" "goto;" "call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);" [2022-02-21 03:33:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:03,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-21 03:33:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:03,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:03,564 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-02-21 03:33:03,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-02-21 03:33:03,587 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-02-21 03:33:03,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-02-21 03:33:03,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:03,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:03,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-02-21 03:33:03,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:03,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 03:33:03,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:33:03,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-02-21 03:33:03,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:04,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:04,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1044#unseeded} is VALID [2022-02-21 03:33:04,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {1130#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1130#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} goto; {1130#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {1130#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1130#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {1130#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1140#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1140#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {1140#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1140#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {1140#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1150#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1150#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {1150#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1150#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {1150#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1160#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {1160#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1160#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1160#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1170#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {1170#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1170#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {1170#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1170#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {1170#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1180#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {1180#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1180#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {1180#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1180#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {1180#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1190#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {1190#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1190#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {1190#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1190#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {1190#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1200#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {1200#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1200#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {1200#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1200#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {1200#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1210#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {1210#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1210#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {1210#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1210#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1220#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {1220#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1220#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {1220#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1220#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:04,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {1220#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1230#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:04,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {1230#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1230#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:04,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {1230#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1118#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) unseeded)} is VALID [2022-02-21 03:33:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:04,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:33:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:04,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:05,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-02-21 03:33:05,451 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:33:05,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2022-02-21 03:33:06,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) (>= oldRank0 (+ 790 (* (- 41) |ULTIMATE.start_main_#t~mem4#1|))))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1237#(and (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (exists ((v_arrayElimCell_35 Int)) (and (<= (+ v_arrayElimCell_35 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_35) 40)))) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:06,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#(and (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (exists ((v_arrayElimCell_35 Int)) (and (<= (+ v_arrayElimCell_35 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_35) 40)))) (< (div (+ (- 790) oldRank0) (- 41)) 20))} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {1241#(and (exists ((v_arrayElimCell_35 Int)) (and (<= (+ v_arrayElimCell_35 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_35) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:06,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1241#(and (exists ((v_arrayElimCell_35 Int)) (and (<= (+ v_arrayElimCell_35 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_35) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} goto; {1241#(and (exists ((v_arrayElimCell_35 Int)) (and (<= (+ v_arrayElimCell_35 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_35) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:06,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#(and (exists ((v_arrayElimCell_35 Int)) (and (<= (+ v_arrayElimCell_35 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_35) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1121#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 790 (* (- 41) |ULTIMATE.start_main_#t~mem4#1|))))))} is VALID [2022-02-21 03:33:06,435 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:33:06,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:06,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 35 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:06,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-02-21 03:33:06,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:06,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 4 states. [2022-02-21 03:33:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:06,522 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:06,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:06,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:06,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:06,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:06,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:06,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:06,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-02-21 03:33:06,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:06,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:06,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:06,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:06,527 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:33:06,527 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:06,527 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:06,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 3 [2022-02-21 03:33:06,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:06,528 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:33:06,528 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:06,529 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:33:06,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:06,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:06,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:06,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:06,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:06,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:06,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:06,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:06,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:06,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:06,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:06,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:06,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:06,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:06,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:06,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:06,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:06,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:06,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:06,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:06,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:06,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:06,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:06,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:06,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:06,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,541 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-02-21 03:33:06,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:06,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:06,543 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:33:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:06,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-21 03:33:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:06,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:06,681 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-02-21 03:33:06,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-02-21 03:33:06,704 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-02-21 03:33:06,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-02-21 03:33:06,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:06,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:06,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:06,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2022-02-21 03:33:07,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:07,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:08,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:08,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1044#unseeded} is VALID [2022-02-21 03:33:08,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {1305#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} goto; {1305#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {1305#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1305#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {1305#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1315#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1315#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {1315#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1315#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1325#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1325#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1325#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {1325#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1335#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {1335#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1335#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {1335#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1335#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1335#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1345#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {1345#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1345#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1345#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1355#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {1355#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1355#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {1355#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1355#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {1355#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1365#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {1365#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1365#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {1365#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1365#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {1365#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1375#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1375#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1375#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {1375#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1375#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {1375#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1385#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1385#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1385#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1385#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1395#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {1395#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1395#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {1395#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1395#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:08,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {1395#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1405#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:08,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {1405#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1405#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:08,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {1405#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1118#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) unseeded)} is VALID [2022-02-21 03:33:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:08,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:33:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:08,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:08,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-02-21 03:33:20,486 WARN L228 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-21 03:33:20,778 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:33:20,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2022-02-21 03:33:33,155 WARN L228 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-21 03:33:35,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) (>= oldRank0 (+ 790 (* (- 41) |ULTIMATE.start_main_#t~mem4#1|))))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1412#(and (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (exists ((v_arrayElimCell_54 Int)) (and (<= (+ v_arrayElimCell_54 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_54) 40)))) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:35,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {1412#(and (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (exists ((v_arrayElimCell_54 Int)) (and (<= (+ v_arrayElimCell_54 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_54) 40)))) (< (div (+ (- 790) oldRank0) (- 41)) 20))} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {1416#(and (exists ((v_arrayElimCell_54 Int)) (and (<= (+ v_arrayElimCell_54 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_54) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:35,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {1416#(and (exists ((v_arrayElimCell_54 Int)) (and (<= (+ v_arrayElimCell_54 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_54) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} goto; {1416#(and (exists ((v_arrayElimCell_54 Int)) (and (<= (+ v_arrayElimCell_54 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_54) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:35,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {1416#(and (exists ((v_arrayElimCell_54 Int)) (and (<= (+ v_arrayElimCell_54 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_54) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1121#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 790 (* (- 41) |ULTIMATE.start_main_#t~mem4#1|))))))} is VALID [2022-02-21 03:33:35,517 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:33:35,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:35,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 35 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:35,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,553 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2022-02-21 03:33:35,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:35,596 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 4 states. [2022-02-21 03:33:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:35,597 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:35,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:35,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:35,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:35,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:35,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:35,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:35,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-02-21 03:33:35,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:35,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:35,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:35,599 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:35,599 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:33:35,599 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:35,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:35,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 3 [2022-02-21 03:33:35,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:35,600 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:33:35,600 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:35,601 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:33:35,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:35,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:35,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:35,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:35,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:35,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:35,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:35,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:35,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:35,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:35,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:35,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:35,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:35,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:35,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:35,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:35,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:35,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,612 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-02-21 03:33:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:35,613 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:33:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:35,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:33:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:35,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:35,747 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-02-21 03:33:35,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-02-21 03:33:35,766 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-02-21 03:33:35,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-02-21 03:33:35,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:35,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:35,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:35,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-02-21 03:33:35,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-02-21 03:33:36,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:33:36,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-02-21 03:33:36,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:33:36,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-02-21 03:33:36,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:36,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:36,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:36,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:36,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:36,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:37,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:37,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:37,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1044#unseeded} is VALID [2022-02-21 03:33:37,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {1480#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1480#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} goto; {1480#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {1480#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1480#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {1480#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1490#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1490#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {1490#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1490#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1490#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1500#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1500#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1500#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {1500#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1500#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {1500#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1510#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1510#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {1510#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1510#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1510#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1520#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {1520#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1520#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {1520#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1520#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {1520#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1530#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1530#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {1530#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1530#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1540#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {1540#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1540#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {1540#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1540#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {1540#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1550#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {1550#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1550#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {1550#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1550#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {1550#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1560#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1560#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {1560#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1560#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {1560#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1570#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {1570#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1570#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {1570#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1570#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:37,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {1570#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1580#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:37,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {1580#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1580#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:37,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {1580#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1118#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) unseeded)} is VALID [2022-02-21 03:33:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:37,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:33:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:37,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:37,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-02-21 03:33:37,810 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:33:37,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2022-02-21 03:33:50,376 WARN L228 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-21 03:33:51,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) (>= oldRank0 (+ 790 (* (- 41) |ULTIMATE.start_main_#t~mem4#1|))))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1587#(and (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (exists ((v_arrayElimCell_75 Int)) (and (<= (+ v_arrayElimCell_75 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_75) 40)))) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:51,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1587#(and (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (exists ((v_arrayElimCell_75 Int)) (and (<= (+ v_arrayElimCell_75 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_75) 40)))) (< (div (+ (- 790) oldRank0) (- 41)) 20))} assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; {1591#(and (exists ((v_arrayElimCell_75 Int)) (and (<= (+ v_arrayElimCell_75 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_75) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:51,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1591#(and (exists ((v_arrayElimCell_75 Int)) (and (<= (+ v_arrayElimCell_75 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_75) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} goto; {1591#(and (exists ((v_arrayElimCell_75 Int)) (and (<= (+ v_arrayElimCell_75 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_75) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} is VALID [2022-02-21 03:33:51,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {1591#(and (exists ((v_arrayElimCell_75 Int)) (and (<= (+ v_arrayElimCell_75 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (<= (div (+ (- 790) oldRank0) (- 41)) (div (* 41 v_arrayElimCell_75) 40)))) (< 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (< (div (+ (- 790) oldRank0) (- 41)) 20))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1121#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 790 (* (- 41) |ULTIMATE.start_main_#t~mem4#1|))))))} is VALID [2022-02-21 03:33:51,485 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:33:51,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:51,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 35 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:51,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,529 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-02-21 03:33:51,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:51,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 23 states. [2022-02-21 03:33:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 12 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:51,927 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:51,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:51,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:51,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:51,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:51,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:51,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:51,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-02-21 03:33:51,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:51,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:51,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:51,931 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:51,931 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:33:51,932 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:51,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:51,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 48 transitions. cyclomatic complexity: 47 [2022-02-21 03:33:51,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:51,934 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:33:51,935 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 44 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:51,935 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:51,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:33:51,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:51,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:51,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:51,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:51,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:51,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:33:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 44 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:33:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,946 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-02-21 03:33:51,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 48 transitions. Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:33:51,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:51,949 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:33:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:33:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:52,086 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-02-21 03:33:52,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-02-21 03:33:52,104 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-02-21 03:33:52,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-02-21 03:33:52,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:52,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:52,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:33:52,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-02-21 03:33:52,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-21 03:33:52,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:33:52,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-02-21 03:33:52,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:52,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:52,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:52,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:52,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:52,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:53,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:53,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:53,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:33:53,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1044#unseeded} is VALID [2022-02-21 03:33:53,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); {1684#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} goto; {1684#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {1684#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1684#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {1684#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) 0) 0) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1694#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {1694#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1694#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {1694#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1694#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {1694#(and unseeded (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1704#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1704#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {1704#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1704#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {1704#(and (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1714#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {1714#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1714#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {1714#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1714#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {1714#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1724#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {1724#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1724#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {1724#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1724#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {1724#(and (<= 4 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1734#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {1734#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1734#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {1734#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1734#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {1734#(and (<= 5 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1744#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {1744#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1744#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {1744#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1744#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {1744#(and unseeded (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1754#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {1754#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1754#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {1754#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1754#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {1754#(and unseeded (<= 7 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1764#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {1764#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1764#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {1764#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1764#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {1764#(and unseeded (<= 8 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1774#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {1774#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1774#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {1774#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1774#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} is VALID [2022-02-21 03:33:53,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {1774#(and unseeded (<= 9 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1.offset| 0))} assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1784#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:53,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {1784#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; {1784#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:53,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {1784#(and unseeded (= |ULTIMATE.start_main_~i~0#1.offset| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {1118#(and (>= (+ (* 41 (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)) (* (- 40) |ULTIMATE.start_main_#t~mem4#1|)) 0) unseeded)} is VALID [2022-02-21 03:33:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:53,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:33:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:53,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:53,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-02-21 03:33:53,945 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:33:53,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48