./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array17_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-15/array17_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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:36,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:36,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:36,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:36,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:36,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:36,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:36,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:36,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:36,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:36,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:36,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:36,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:36,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:36,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:36,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:36,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:36,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:36,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:36,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:36,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:36,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:36,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:36,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:36,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:36,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:36,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:36,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:36,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:36,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:36,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:36,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:36,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:36,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:36,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:36,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:36,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:36,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:36,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:36,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:36,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:36,617 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:34:36,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:36,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:36,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:36,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:36,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:36,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:36,654 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:36,654 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:36,655 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:36,655 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:36,656 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:36,656 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:36,656 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:36,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:36,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:36,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:36,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:36,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:36,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:36,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:36,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:36,658 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:36,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:36,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:36,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:36,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:36,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:36,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:36,660 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:36,660 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2022-02-21 03:34:36,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:36,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:36,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:36,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:36,927 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:36,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array17_alloca.i [2022-02-21 03:34:36,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb2b61b4/644e03aa1bd54f93bb7f8a9ba87e2342/FLAGb29121d1a [2022-02-21 03:34:37,494 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:37,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2022-02-21 03:34:37,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb2b61b4/644e03aa1bd54f93bb7f8a9ba87e2342/FLAGb29121d1a [2022-02-21 03:34:37,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb2b61b4/644e03aa1bd54f93bb7f8a9ba87e2342 [2022-02-21 03:34:37,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:37,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:37,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:37,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:37,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:37,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:37" (1/1) ... [2022-02-21 03:34:37,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3bcc57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:37, skipping insertion in model container [2022-02-21 03:34:37,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:37" (1/1) ... [2022-02-21 03:34:37,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:37,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:38,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:38,153 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:38,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:38,249 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:38,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38 WrapperNode [2022-02-21 03:34:38,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:38,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:38,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:38,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:38,259 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:34:38" (1/1) ... [2022-02-21 03:34:38,281 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:34:38" (1/1) ... [2022-02-21 03:34:38,311 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2022-02-21 03:34:38,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:38,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:38,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:38,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:38,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:38,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:38,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:38,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:38,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (1/1) ... [2022-02-21 03:34:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:38,383 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:34:38,389 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:34:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:38,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:38,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:38,527 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:38,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:38,786 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:38,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:38,800 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:34:38,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:38 BoogieIcfgContainer [2022-02-21 03:34:38,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:38,803 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:38,804 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:38,807 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:38,808 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:38,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:37" (1/3) ... [2022-02-21 03:34:38,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1739275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:38, skipping insertion in model container [2022-02-21 03:34:38,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:38,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:38" (2/3) ... [2022-02-21 03:34:38,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1739275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:38, skipping insertion in model container [2022-02-21 03:34:38,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:38,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:38" (3/3) ... [2022-02-21 03:34:38,812 INFO L388 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2022-02-21 03:34:38,866 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:38,866 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:38,867 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:38,867 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:38,867 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:38,867 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:38,867 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:38,867 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:38,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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:34:38,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:38,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:38,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:38,920 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:34:38,920 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:38,921 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:38,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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:34:38,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:38,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:38,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:38,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:34:38,927 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:38,933 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; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 14#L367true assume !(main_~length~0#1 < 1); 12#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 15#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 17#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 5#L375-3true [2022-02-21 03:34:38,934 INFO L793 eck$LassoCheckResult]: Loop: 5#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 10#L375-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5#L375-3true [2022-02-21 03:34:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2022-02-21 03:34:38,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:38,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290817007] [2022-02-21 03:34:38,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:39,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:39,089 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-02-21 03:34:39,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:39,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529497980] [2022-02-21 03:34:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:39,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:39,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2022-02-21 03:34:39,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:39,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237126632] [2022-02-21 03:34:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:39,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:39,219 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:39,578 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:39,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:39,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:39,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:39,579 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:39,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:39,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:39,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:39,580 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2022-02-21 03:34:39,580 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:39,580 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:39,595 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:34:39,602 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:34:39,606 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:34:39,608 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:34:39,611 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:34:39,614 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:34:39,617 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:34:39,620 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:34:39,623 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:34:39,626 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:34:39,629 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:34:39,633 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:34:39,802 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:34:40,143 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:40,146 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:40,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,151 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:34:40,162 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:34:40,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,175 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:34:40,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,202 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:34:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,205 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:34:40,206 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:34:40,208 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:34:40,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:40,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:40,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,260 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:34:40,264 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:34:40,265 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:34:40,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,307 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:34:40,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,309 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:34:40,320 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:34:40,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,331 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:34:40,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,364 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:34:40,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,366 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:34:40,371 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:34:40,372 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:34:40,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,449 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:34:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,451 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:34:40,452 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:34:40,453 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:34:40,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,501 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:34:40,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,503 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:34:40,509 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:34:40,513 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:34:40,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:34:40,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,544 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:34:40,544 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:34:40,546 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:34:40,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,570 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:34:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,571 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:34:40,572 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:34:40,573 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:34:40,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,598 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:34:40,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:40,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:34:40,603 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:34:40,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:40,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:40,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:34:40,641 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:34:40,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:40,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:40,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:34:40,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,673 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:34:40,673 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:34:40,676 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:34:40,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:34:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,727 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:34:40,728 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:34:40,734 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:34:40,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:40,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:40,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:34:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,777 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:34:40,777 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:34:40,779 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:34:40,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:40,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:40,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:34:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,833 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:34:40,834 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:34:40,836 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:34:40,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:40,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:40,865 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:40,910 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-02-21 03:34:40,910 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-02-21 03:34:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,921 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:34:40,922 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:34:40,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:40,961 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:40,961 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:40,961 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 03:34:41,002 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:34:41,019 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:41,024 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1;" "main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" [2022-02-21 03:34:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:41,119 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:34:41,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2022-02-21 03:34:41,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {25#unseeded} is VALID [2022-02-21 03:34:41,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0#1 < 1); {25#unseeded} is VALID [2022-02-21 03:34:41,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#unseeded} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {25#unseeded} is VALID [2022-02-21 03:34:41,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {25#unseeded} is VALID [2022-02-21 03:34:41,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#unseeded} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {25#unseeded} is VALID [2022-02-21 03:34:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:41,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {73#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:41,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))) unseeded)} is VALID [2022-02-21 03:34:41,182 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:34:41,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:41,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:41,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,227 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:34:41,228 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 49 transitions. Complement of second has 7 states. [2022-02-21 03:34:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:41,321 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:41,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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:34:41,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:41,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:41,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 49 transitions. [2022-02-21 03:34:41,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:41,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,342 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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:34:41,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:41,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:34:41,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:41,349 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:41,349 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 49 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:41,350 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:41,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:41,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:41,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 34 letters. [2022-02-21 03:34:41,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:34:41,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:34:41,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 15 letters. Loop has 15 letters. [2022-02-21 03:34:41,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:41,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:41,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:41,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:41,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:41,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:41,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:41,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:41,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:41,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:41,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:41,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:41,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:41,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:41,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2 letters. [2022-02-21 03:34:41,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:41,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 49 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:34:41,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,384 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-21 03:34:41,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:34:41,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:41,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:34:41,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:41,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:41,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 12 states and 16 transitions. [2022-02-21 03:34:41,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:34:41,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:34:41,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 03:34:41,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:41,399 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 03:34:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:34:41,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:41,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,416 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,418 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,421 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:34:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:34:41,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 03:34:41,423 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 03:34:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,424 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:34:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:34:41,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:41,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:34:41,427 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:41,427 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:41,427 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:41,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:34:41,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:41,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,428 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:41,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:41,429 INFO L791 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 132#L367 assume !(main_~length~0#1 < 1); 129#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 130#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 131#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 123#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 124#L375-4 main_~j~0#1 := 1; 121#L380-2 [2022-02-21 03:34:41,429 INFO L793 eck$LassoCheckResult]: Loop: 121#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 122#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 121#L380-2 [2022-02-21 03:34:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2022-02-21 03:34:41,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315184631] [2022-02-21 03:34:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {160#true} is VALID [2022-02-21 03:34:41,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {160#true} is VALID [2022-02-21 03:34:41,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume !(main_~length~0#1 < 1); {162#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:41,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {162#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:41,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {162#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:41,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {163#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:41,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {161#false} is VALID [2022-02-21 03:34:41,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#false} main_~j~0#1 := 1; {161#false} is VALID [2022-02-21 03:34:41,519 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:34:41,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:41,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315184631] [2022-02-21 03:34:41,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315184631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:41,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:41,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:41,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119252980] [2022-02-21 03:34:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:41,523 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2022-02-21 03:34:41,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892476627] [2022-02-21 03:34:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,538 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:41,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:41,623 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,666 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:34:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:41,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:41,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-02-21 03:34:41,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:41,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 03:34:41,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:34:41,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:34:41,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-02-21 03:34:41,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:41,680 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 03:34:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-02-21 03:34:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 03:34:41,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:41,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,683 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,683 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,684 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:34:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:34:41,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 03:34:41,689 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 03:34:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,695 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:34:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:34:41,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:41,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 03:34:41,697 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:34:41,697 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:34:41,698 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:41,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:34:41,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:41,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:41,700 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:41,700 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 189#L367 assume !(main_~length~0#1 < 1); 183#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 184#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 190#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 185#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 186#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 187#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 188#L375-4 main_~j~0#1 := 1; 179#L380-2 [2022-02-21 03:34:41,700 INFO L793 eck$LassoCheckResult]: Loop: 179#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 180#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 179#L380-2 [2022-02-21 03:34:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2022-02-21 03:34:41,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136553070] [2022-02-21 03:34:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,750 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2022-02-21 03:34:41,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469973651] [2022-02-21 03:34:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,768 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2022-02-21 03:34:41,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66807885] [2022-02-21 03:34:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {224#true} is VALID [2022-02-21 03:34:41,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {224#true} is VALID [2022-02-21 03:34:41,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume !(main_~length~0#1 < 1); {224#true} is VALID [2022-02-21 03:34:41,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {224#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {224#true} is VALID [2022-02-21 03:34:41,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {224#true} is VALID [2022-02-21 03:34:41,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {226#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:41,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {226#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:41,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {227#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:41,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:41,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 1; {229#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-21 03:34:41,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {229#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {225#false} is VALID [2022-02-21 03:34:41,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {225#false} is VALID [2022-02-21 03:34:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:41,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:41,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66807885] [2022-02-21 03:34:41,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66807885] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:41,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588979423] [2022-02-21 03:34:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,873 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:41,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:34:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:34:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:42,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {224#true} is VALID [2022-02-21 03:34:42,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {224#true} is VALID [2022-02-21 03:34:42,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume !(main_~length~0#1 < 1); {224#true} is VALID [2022-02-21 03:34:42,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {224#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {224#true} is VALID [2022-02-21 03:34:42,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {224#true} is VALID [2022-02-21 03:34:42,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {227#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:42,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:42,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 1; {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:42,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {225#false} is VALID [2022-02-21 03:34:42,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {225#false} is VALID [2022-02-21 03:34:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:42,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:42,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {225#false} is VALID [2022-02-21 03:34:42,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {225#false} is VALID [2022-02-21 03:34:42,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 1; {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:42,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {228#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:42,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {227#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:42,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {224#true} is VALID [2022-02-21 03:34:42,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {224#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {224#true} is VALID [2022-02-21 03:34:42,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume !(main_~length~0#1 < 1); {224#true} is VALID [2022-02-21 03:34:42,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {224#true} is VALID [2022-02-21 03:34:42,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {224#true} is VALID [2022-02-21 03:34:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:42,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588979423] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:42,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:42,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-02-21 03:34:42,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443502378] [2022-02-21 03:34:42,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:42,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:34:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:34:42,203 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:42,339 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-21 03:34:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:34:42,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:42,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:42,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2022-02-21 03:34:42,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:42,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2022-02-21 03:34:42,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:34:42,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:34:42,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2022-02-21 03:34:42,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:42,361 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:34:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2022-02-21 03:34:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 03:34:42,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:42,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:42,363 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:42,363 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:42,364 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:34:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:34:42,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:42,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:42,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 17 transitions. [2022-02-21 03:34:42,365 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 17 transitions. [2022-02-21 03:34:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:42,366 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:34:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:34:42,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:42,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:42,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:42,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:34:42,367 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:34:42,367 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:34:42,368 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:34:42,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:34:42,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:42,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:42,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:42,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:42,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:42,369 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 339#L367 assume !(main_~length~0#1 < 1); 337#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 338#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 340#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 331#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 332#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 333#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 334#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 342#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 341#L375-4 main_~j~0#1 := 1; 329#L380-2 [2022-02-21 03:34:42,369 INFO L793 eck$LassoCheckResult]: Loop: 329#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 330#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 329#L380-2 [2022-02-21 03:34:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2022-02-21 03:34:42,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812063391] [2022-02-21 03:34:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,434 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2022-02-21 03:34:42,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121472889] [2022-02-21 03:34:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,453 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2022-02-21 03:34:42,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414440398] [2022-02-21 03:34:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,500 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,868 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:42,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:42,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:42,869 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:42,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:42,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:42,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:42,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:42,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2022-02-21 03:34:42,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:42,869 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:42,871 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:34:42,875 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:34:42,877 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:34:42,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:34:42,883 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:34:42,885 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:34:42,888 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:34:43,156 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:34:43,158 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:34:43,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:34:43,162 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:34:43,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:34:43,458 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:43,458 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:43,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,461 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:34:43,462 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:34:43,485 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:34:43,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:43,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:43,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:43,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,509 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:34:43,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,510 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:34:43,514 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:34:43,515 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:34:43,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:43,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:43,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:43,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,549 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:34:43,550 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:34:43,551 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:34:43,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:43,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:43,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:43,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:43,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,575 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:34:43,575 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:34:43,577 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:34:43,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:43,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:43,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,640 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:34:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,642 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:34:43,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:34:43,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:43,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:43,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:43,658 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:34:43,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:34:43,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,688 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:34:43,688 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:34:43,690 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:34:43,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:43,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:43,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:43,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,719 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:34:43,720 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:34:43,721 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:34:43,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:43,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:43,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:43,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:34:43,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,781 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:34:43,782 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:34:43,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:34:43,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:43,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:43,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:43,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:43,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:43,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:43,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:43,860 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-02-21 03:34:43,860 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-02-21 03:34:43,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:43,867 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:34:43,872 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:43,881 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:34:43,890 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:43,891 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:43,891 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:34:43,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:43,939 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:34:43,943 INFO L390 LassoCheck]: Loop: "assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2022-02-21 03:34:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:43,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:43,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:44,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {382#unseeded} is VALID [2022-02-21 03:34:44,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {382#unseeded} is VALID [2022-02-21 03:34:44,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {382#unseeded} assume !(main_~length~0#1 < 1); {382#unseeded} is VALID [2022-02-21 03:34:44,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {382#unseeded} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {382#unseeded} is VALID [2022-02-21 03:34:44,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {382#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {382#unseeded} is VALID [2022-02-21 03:34:44,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {382#unseeded} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {382#unseeded} is VALID [2022-02-21 03:34:44,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#unseeded} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {382#unseeded} is VALID [2022-02-21 03:34:44,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#unseeded} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {382#unseeded} is VALID [2022-02-21 03:34:44,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {382#unseeded} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {382#unseeded} is VALID [2022-02-21 03:34:44,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#unseeded} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {382#unseeded} is VALID [2022-02-21 03:34:44,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#unseeded} assume !(main_~i~0#1 < main_~length~0#1); {382#unseeded} is VALID [2022-02-21 03:34:44,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#unseeded} main_~j~0#1 := 1; {382#unseeded} is VALID [2022-02-21 03:34:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:44,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:44,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:44,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {463#(and (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~length~0#1|)))} is VALID [2022-02-21 03:34:44,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#(and (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~length~0#1|)))} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {425#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~length~0#1|))))} is VALID [2022-02-21 03:34:44,040 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:34:44,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:34:44,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:44,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,048 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:34:44,048 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:34:44,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Result 18 states and 22 transitions. Complement of second has 5 states. [2022-02-21 03:34:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:44,076 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:44,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:44,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:44,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:44,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:34:44,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:44,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:44,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:44,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:34:44,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:44,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:44,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:44,086 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 16 transitions. cyclomatic complexity: 4 [2022-02-21 03:34:44,088 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:44,088 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:34:44,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:44,089 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:44,089 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 22 transitions. cyclomatic complexity: 7 [2022-02-21 03:34:44,090 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:44,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:44,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:44,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:44,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:44,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:44,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:34:44,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:34:44,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:34:44,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:34:44,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:34:44,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:34:44,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:34:44,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:34:44,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:34:44,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:34:44,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:44,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:44,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:44,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 16 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:44,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:44,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:34:44,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,103 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:34:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:34:44,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:34:44,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:34:44,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:34:44,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:44,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. cyclomatic complexity: 7 [2022-02-21 03:34:44,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:44,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2022-02-21 03:34:44,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:34:44,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:34:44,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2022-02-21 03:34:44,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:34:44,110 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-21 03:34:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2022-02-21 03:34:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:34:44,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:44,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:44,111 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:44,111 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:44,112 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:44,113 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:34:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:34:44,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:44,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:44,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 22 transitions. [2022-02-21 03:34:44,114 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 22 transitions. [2022-02-21 03:34:44,114 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:44,115 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:34:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:34:44,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:44,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:44,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:44,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-02-21 03:34:44,116 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-21 03:34:44,116 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-21 03:34:44,116 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:34:44,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:34:44,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:44,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:44,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:44,117 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:44,117 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:44,117 INFO L791 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 505#L367 assume !(main_~length~0#1 < 1); 499#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 500#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 506#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 501#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 502#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 503#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 504#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 509#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 507#L375-4 main_~j~0#1 := 1; 508#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 496#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 492#L380-2 [2022-02-21 03:34:44,118 INFO L793 eck$LassoCheckResult]: Loop: 492#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 493#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 492#L380-2 [2022-02-21 03:34:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2022-02-21 03:34:44,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:44,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795880055] [2022-02-21 03:34:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:44,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {613#true} is VALID [2022-02-21 03:34:44,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {613#true} is VALID [2022-02-21 03:34:44,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume !(main_~length~0#1 < 1); {613#true} is VALID [2022-02-21 03:34:44,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {613#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:44,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:44,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:44,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {617#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} is VALID [2022-02-21 03:34:44,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {617#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {618#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:44,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {619#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:44,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:44,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~length~0#1); {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:44,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_~j~0#1 := 1; {621#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~j~0#1| 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:44,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~j~0#1| 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {622#(and (<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-21 03:34:44,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {622#(and (<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {614#false} is VALID [2022-02-21 03:34:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:44,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:44,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795880055] [2022-02-21 03:34:44,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795880055] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:44,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765578730] [2022-02-21 03:34:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:44,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:44,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:44,389 INFO L229 MonitoredProcess]: Starting monitored process 28 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:34:44,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-21 03:34:44,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:44,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:34:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:44,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:44,580 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:34:44,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:44,728 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 25 treesize of output 24 [2022-02-21 03:34:44,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:44,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:44,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:44,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:44,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:34:44,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 18 [2022-02-21 03:34:45,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {613#true} is VALID [2022-02-21 03:34:45,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {613#true} is VALID [2022-02-21 03:34:45,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume !(main_~length~0#1 < 1); {613#true} is VALID [2022-02-21 03:34:45,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {613#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:45,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:45,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {615#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:45,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {617#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} is VALID [2022-02-21 03:34:45,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {617#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {618#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:45,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:45,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:45,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~length~0#1); {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:45,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_~j~0#1 := 1; {659#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:45,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {663#(<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:45,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#(<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|)} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {614#false} is VALID [2022-02-21 03:34:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:45,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:46,008 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)))) is different from false [2022-02-21 03:34:46,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))))) is different from false [2022-02-21 03:34:47,058 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 52 treesize of output 48 [2022-02-21 03:34:47,142 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-21 03:34:47,143 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 814 treesize of output 724 [2022-02-21 03:34:47,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#(<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|)} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {614#false} is VALID [2022-02-21 03:34:47,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#(or (not (< 0 |ULTIMATE.start_main_~j~0#1|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~j~0#1| 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {663#(<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:47,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} main_~j~0#1 := 1; {670#(or (not (< 0 |ULTIMATE.start_main_~j~0#1|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~j~0#1| 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:47,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} assume !(main_~i~0#1 < main_~length~0#1); {674#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} is VALID [2022-02-21 03:34:47,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {674#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} is VALID [2022-02-21 03:34:47,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {684#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {674#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} is VALID [2022-02-21 03:34:47,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {688#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (not (<= |ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {684#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (<= |ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} is VALID [2022-02-21 03:34:47,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {692#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {688#(forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (not (<= |ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60) (+ (* |v_ULTIMATE.start_main_~j~0#1_56| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1))))} is VALID [2022-02-21 03:34:47,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {692#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:47,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {613#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {613#true} is VALID [2022-02-21 03:34:47,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {613#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {613#true} is VALID [2022-02-21 03:34:47,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume !(main_~length~0#1 < 1); {613#true} is VALID [2022-02-21 03:34:47,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {613#true} is VALID [2022-02-21 03:34:47,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {613#true} is VALID [2022-02-21 03:34:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-21 03:34:47,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765578730] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:47,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:47,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-02-21 03:34:47,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594481368] [2022-02-21 03:34:47,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:47,717 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2022-02-21 03:34:47,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:47,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897640309] [2022-02-21 03:34:47,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:47,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:47,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:47,743 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:47,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:34:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2022-02-21 03:34:47,809 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 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:34:48,327 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) |c_ULTIMATE.start_main_~value~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-02-21 03:34:48,775 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |c_ULTIMATE.start_main_~value~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-02-21 03:34:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:48,903 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-21 03:34:48,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:34:48,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 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:34:48,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:48,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2022-02-21 03:34:48,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:48,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 35 transitions. [2022-02-21 03:34:48,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:34:48,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:34:48,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2022-02-21 03:34:48,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:34:48,942 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-21 03:34:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2022-02-21 03:34:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-02-21 03:34:48,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:48,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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:34:48,943 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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:34:48,944 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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:34:48,944 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,945 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 03:34:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:34:48,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 28 states and 35 transitions. [2022-02-21 03:34:48,946 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 28 states and 35 transitions. [2022-02-21 03:34:48,952 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:48,956 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 03:34:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:34:48,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:48,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:48,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:48,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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:34:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:34:48,959 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:34:48,959 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:34:48,959 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:34:48,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:34:48,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:48,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:48,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:48,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:48,962 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:48,962 INFO L791 eck$LassoCheckResult]: Stem: 750#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 758#L367 assume !(main_~length~0#1 < 1); 752#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 753#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 759#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 754#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 755#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 756#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 757#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 766#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 765#L375-4 main_~j~0#1 := 1; 764#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 749#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 747#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 748#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 745#L380-2 [2022-02-21 03:34:48,962 INFO L793 eck$LassoCheckResult]: Loop: 745#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 746#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 745#L380-2 [2022-02-21 03:34:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2022-02-21 03:34:48,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:48,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119590114] [2022-02-21 03:34:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {916#true} is VALID [2022-02-21 03:34:49,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {916#true} is VALID [2022-02-21 03:34:49,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume !(main_~length~0#1 < 1); {916#true} is VALID [2022-02-21 03:34:49,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {916#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {916#true} is VALID [2022-02-21 03:34:49,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {916#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {916#true} is VALID [2022-02-21 03:34:49,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {918#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:49,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {918#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {918#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:49,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {918#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:49,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:49,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {920#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:34:49,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:34:49,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 1; {922#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:34:49,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {922#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {922#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:34:49,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {923#(<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:34:49,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#(<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {917#false} is VALID [2022-02-21 03:34:49,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#false} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {917#false} is VALID [2022-02-21 03:34:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:49,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:49,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119590114] [2022-02-21 03:34:49,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119590114] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:49,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139413052] [2022-02-21 03:34:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:49,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:49,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,081 INFO L229 MonitoredProcess]: Starting monitored process 29 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:34:49,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-21 03:34:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:34:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:49,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {916#true} is VALID [2022-02-21 03:34:49,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {916#true} is VALID [2022-02-21 03:34:49,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume !(main_~length~0#1 < 1); {916#true} is VALID [2022-02-21 03:34:49,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {916#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {916#true} is VALID [2022-02-21 03:34:49,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {916#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {916#true} is VALID [2022-02-21 03:34:49,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:49,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:49,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:49,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:49,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {920#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:34:49,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:34:49,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 1; {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:34:49,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {964#(and (< 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:34:49,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {964#(and (< 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {968#(and (<= |ULTIMATE.start_main_~length~0#1| 2) (< 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:49,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(and (<= |ULTIMATE.start_main_~length~0#1| 2) (< 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {917#false} is VALID [2022-02-21 03:34:49,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#false} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {917#false} is VALID [2022-02-21 03:34:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:49,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:49,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#false} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {917#false} is VALID [2022-02-21 03:34:49,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#(<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {917#false} is VALID [2022-02-21 03:34:49,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {923#(<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:34:49,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {981#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:34:49,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 1; {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:34:49,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {921#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:34:49,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {920#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:34:49,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:49,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {919#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:49,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:49,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {942#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:49,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {916#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {916#true} is VALID [2022-02-21 03:34:49,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {916#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {916#true} is VALID [2022-02-21 03:34:49,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume !(main_~length~0#1 < 1); {916#true} is VALID [2022-02-21 03:34:49,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {916#true} is VALID [2022-02-21 03:34:49,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {916#true} is VALID [2022-02-21 03:34:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:49,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139413052] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:49,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:49,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-02-21 03:34:49,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58347371] [2022-02-21 03:34:49,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:49,400 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2022-02-21 03:34:49,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:49,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995139632] [2022-02-21 03:34:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:49,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:49,417 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:49,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:49,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:34:49,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:34:49,491 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:34:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:49,609 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-21 03:34:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:34:49,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:34:49,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:49,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2022-02-21 03:34:49,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:49,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 25 transitions. [2022-02-21 03:34:49,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:34:49,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:34:49,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2022-02-21 03:34:49,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:34:49,636 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:34:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2022-02-21 03:34:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-21 03:34:49,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:49,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,637 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,637 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,638 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:49,639 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:34:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:34:49,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:49,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:49,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 03:34:49,639 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 03:34:49,640 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:34:49,641 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:34:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:34:49,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:49,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:49,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:49,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-21 03:34:49,646 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 03:34:49,646 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 03:34:49,646 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:34:49,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:34:49,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:49,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:49,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:49,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:49,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:49,648 INFO L791 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1061#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1065#L367 assume !(main_~length~0#1 < 1); 1062#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1063#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1064#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1056#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1057#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1058#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1059#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1070#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1069#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1068#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1066#L375-4 main_~j~0#1 := 1; 1067#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1054#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1051#L380-2 [2022-02-21 03:34:49,648 INFO L793 eck$LassoCheckResult]: Loop: 1051#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1052#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1051#L380-2 [2022-02-21 03:34:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2020585215, now seen corresponding path program 2 times [2022-02-21 03:34:49,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:49,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12272031] [2022-02-21 03:34:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1191#true} is VALID [2022-02-21 03:34:49,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1191#true} is VALID [2022-02-21 03:34:49,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume !(main_~length~0#1 < 1); {1191#true} is VALID [2022-02-21 03:34:49,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {1191#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:49,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:49,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {1194#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:49,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {1194#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {1195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} is VALID [2022-02-21 03:34:49,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {1196#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:49,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {1197#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:49,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {1198#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:34:49,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {1198#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:49,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:49,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~length~0#1); {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:49,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_~j~0#1 := 1; {1200#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~j~0#1| 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:49,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {1200#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~j~0#1| 4))) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {1201#(and (<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-21 03:34:49,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {1201#(and (<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {1192#false} is VALID [2022-02-21 03:34:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:49,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:49,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12272031] [2022-02-21 03:34:49,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12272031] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:49,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168974254] [2022-02-21 03:34:49,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:34:49,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:49,919 INFO L229 MonitoredProcess]: Starting monitored process 30 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:34:49,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-21 03:34:49,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:34:49,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:34:49,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:34:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:49,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:50,066 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:34:50,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:50,178 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 25 treesize of output 24 [2022-02-21 03:34:50,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:50,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:50,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:50,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:34:50,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-02-21 03:34:50,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:50,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:50,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:50,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:50,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:34:50,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 18 [2022-02-21 03:34:50,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1191#true} is VALID [2022-02-21 03:34:50,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1191#true} is VALID [2022-02-21 03:34:50,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume !(main_~length~0#1 < 1); {1191#true} is VALID [2022-02-21 03:34:50,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {1191#true} assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:50,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:50,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; {1194#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:50,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1194#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {1195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} is VALID [2022-02-21 03:34:50,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~value~0#1|))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {1196#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:50,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |ULTIMATE.start_main_~value~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {1197#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:34:50,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {1232#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_45| Int)) (and (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |v_ULTIMATE.start_main_~i~0#1_45|) (<= |v_ULTIMATE.start_main_~i~0#1_45| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_45| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |ULTIMATE.start_main_~arr~0#1.offset|))))))} is VALID [2022-02-21 03:34:50,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {1232#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_45| Int)) (and (<= (+ (div (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |v_ULTIMATE.start_main_~i~0#1_45|) (<= |v_ULTIMATE.start_main_~i~0#1_45| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_45| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |ULTIMATE.start_main_~arr~0#1.offset|))))))} assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:50,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:50,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~length~0#1); {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:50,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_~j~0#1 := 1; {1245#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:34:50,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {1245#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); {1249#(<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:50,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1249#(<= (+ |ULTIMATE.start_main_#t~mem211#1| 1) |ULTIMATE.start_main_#t~mem210#1|)} assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; {1192#false} is VALID [2022-02-21 03:34:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:50,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:51,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) is different from false [2022-02-21 03:35:03,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_47| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_47|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))))) is different from false [2022-02-21 03:35:05,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_47|)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_92)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) is different from false [2022-02-21 03:35:06,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_92) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_47|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_92)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) is different from false [2022-02-21 03:35:06,898 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 66 treesize of output 62 [2022-02-21 03:35:07,048 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-21 03:35:07,049 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47976 treesize of output 44648