./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/c.01_assume-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 252aa5e38f898b42e65698848f3b58e46a12e01218aba7e2f3e037db40adbdd2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:07,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:07,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:07,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:07,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:07,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:07,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:07,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:07,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:07,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:07,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:07,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:07,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:07,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:07,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:07,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:07,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:07,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:07,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:07,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:07,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:07,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:07,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:07,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:07,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:07,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:07,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:07,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:07,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:07,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:07,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:07,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:07,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:07,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:07,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:07,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:07,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:07,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:07,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:07,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:07,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:07,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:07,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:07,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:07,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:07,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:07,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:07,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:07,851 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:07,851 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:07,851 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:07,851 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:07,852 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:07,852 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:07,853 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:07,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:07,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:07,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:07,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:07,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:07,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:07,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:07,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:07,854 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:07,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:07,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:07,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:07,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:07,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:07,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:07,856 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:07,857 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 -> 252aa5e38f898b42e65698848f3b58e46a12e01218aba7e2f3e037db40adbdd2 [2022-02-21 03:32:08,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:08,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:08,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:08,065 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:08,066 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:08,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2022-02-21 03:32:08,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ae2775a/0dec9c4fd15a437e8dce62f3a1efe492/FLAGfad1eedfb [2022-02-21 03:32:08,548 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:08,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2022-02-21 03:32:08,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ae2775a/0dec9c4fd15a437e8dce62f3a1efe492/FLAGfad1eedfb [2022-02-21 03:32:08,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ae2775a/0dec9c4fd15a437e8dce62f3a1efe492 [2022-02-21 03:32:08,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:08,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:08,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:08,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:08,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:08,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:08" (1/1) ... [2022-02-21 03:32:08,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5738147c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:08, skipping insertion in model container [2022-02-21 03:32:08,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:08" (1/1) ... [2022-02-21 03:32:08,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:08,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:09,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:09,209 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:09,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:09,299 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:09,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09 WrapperNode [2022-02-21 03:32:09,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:09,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:09,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:09,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:09,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,356 INFO L137 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-02-21 03:32:09,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:09,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:09,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:09,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:09,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:09,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:09,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:09,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:09,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (1/1) ... [2022-02-21 03:32:09,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:09,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:09,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:32:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:09,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:09,547 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:09,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:09,758 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:09,763 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:09,763 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:09,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:09 BoogieIcfgContainer [2022-02-21 03:32:09,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:09,766 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:09,766 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:09,768 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:09,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:09,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:08" (1/3) ... [2022-02-21 03:32:09,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@319cf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:09, skipping insertion in model container [2022-02-21 03:32:09,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:09,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:09" (2/3) ... [2022-02-21 03:32:09,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@319cf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:09, skipping insertion in model container [2022-02-21 03:32:09,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:09,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:09" (3/3) ... [2022-02-21 03:32:09,772 INFO L388 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca.i [2022-02-21 03:32:09,825 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:09,826 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:09,826 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:09,826 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:09,826 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:09,826 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:09,826 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:09,827 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:09,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:32:09,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:09,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:09,873 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:09,873 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:09,874 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:09,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:09,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:32:09,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:09,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:09,881 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:09,881 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:09,887 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 6#L553-3true [2022-02-21 03:32:09,887 INFO L793 eck$LassoCheckResult]: Loop: 6#L553-3true call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 10#L555-5true assume !true; 12#L555-6true call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 6#L553-3true [2022-02-21 03:32:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:32:09,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:09,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002301430] [2022-02-21 03:32:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,055 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2022-02-21 03:32:10,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:10,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192842784] [2022-02-21 03:32:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:10,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {20#true} is VALID [2022-02-21 03:32:10,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {20#true} is VALID [2022-02-21 03:32:10,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-21 03:32:10,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#false} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {21#false} is VALID [2022-02-21 03:32:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:10,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:10,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192842784] [2022-02-21 03:32:10,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192842784] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:10,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:10,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:10,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386710362] [2022-02-21 03:32:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:10,152 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:10,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:32:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:32:10,189 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:10,213 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:32:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:32:10,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:10,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2022-02-21 03:32:10,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:32:10,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2022-02-21 03:32:10,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:32:10,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:32:10,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-02-21 03:32:10,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:10,239 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:32:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-02-21 03:32:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:32:10,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:10,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,260 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,262 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:10,264 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:32:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:32:10,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:10,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:10,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 11 transitions. [2022-02-21 03:32:10,268 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 11 transitions. [2022-02-21 03:32:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:10,269 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:32:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:32:10,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:10,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:10,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:10,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2022-02-21 03:32:10,272 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:32:10,272 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:32:10,272 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:10,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:32:10,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:32:10,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:10,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:10,277 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:10,277 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:10,278 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 41#L553-3 [2022-02-21 03:32:10,280 INFO L793 eck$LassoCheckResult]: Loop: 41#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 43#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 42#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 44#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 38#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 39#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 41#L553-3 [2022-02-21 03:32:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:32:10,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:10,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033745430] [2022-02-21 03:32:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,336 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2022-02-21 03:32:10,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:10,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343925314] [2022-02-21 03:32:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:10,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {68#true} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {68#true} is VALID [2022-02-21 03:32:10,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {70#(= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)} is VALID [2022-02-21 03:32:10,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {71#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)} is VALID [2022-02-21 03:32:10,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {71#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {72#|ULTIMATE.start_test_fun_#t~short8#1|} is VALID [2022-02-21 03:32:10,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {72#|ULTIMATE.start_test_fun_#t~short8#1|} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {69#false} is VALID [2022-02-21 03:32:10,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {69#false} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {69#false} is VALID [2022-02-21 03:32:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:10,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:10,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343925314] [2022-02-21 03:32:10,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343925314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:10,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:10,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:32:10,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674815314] [2022-02-21 03:32:10,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:10,451 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:10,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:10,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:32:10,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:32:10,453 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:10,581 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:32:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:32:10,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:10,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:10,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2022-02-21 03:32:10,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-02-21 03:32:10,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2022-02-21 03:32:10,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:32:10,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:32:10,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2022-02-21 03:32:10,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:10,598 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:32:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2022-02-21 03:32:10,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2022-02-21 03:32:10,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:10,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 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:32:10,602 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 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:32:10,602 INFO L87 Difference]: Start difference. First operand 17 states and 21 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:32:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:10,604 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:32:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:32:10,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:10,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:10,605 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 17 states and 21 transitions. [2022-02-21 03:32:10,605 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 17 states and 21 transitions. [2022-02-21 03:32:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:10,607 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:32:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:32:10,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:10,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:10,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:10,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:10,609 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:32:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 03:32:10,610 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:32:10,610 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:32:10,611 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:10,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:32:10,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 03:32:10,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:10,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:10,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:10,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:10,613 INFO L791 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 93#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 97#L553-3 [2022-02-21 03:32:10,613 INFO L793 eck$LassoCheckResult]: Loop: 97#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 98#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 100#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 101#L555-1 assume !test_fun_#t~short8#1; 102#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 96#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 97#L553-3 [2022-02-21 03:32:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:10,614 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:32:10,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:10,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820148027] [2022-02-21 03:32:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,670 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2022-02-21 03:32:10,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:10,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568798712] [2022-02-21 03:32:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,695 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,716 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:10,717 INFO L85 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2022-02-21 03:32:10,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:10,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411500450] [2022-02-21 03:32:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:10,769 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:11,282 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:11,282 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:11,282 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:11,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:11,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:11,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:11,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:11,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:11,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration3_Lasso [2022-02-21 03:32:11,283 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:11,283 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:11,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:11,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:12,213 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:12,217 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:32:12,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:32:12,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,355 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:32:12,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:32:12,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:32:12,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:32:12,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:12,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:12,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:32:12,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:12,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:12,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:32:12,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:32:12,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:32:12,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:32:12,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:12,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:12,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:12,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:32:12,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:32:12,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,661 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:32:12,661 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:32:12,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,687 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:32:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,689 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:32:12,690 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:32:12,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:12,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:12,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,757 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:32:12,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,773 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:32:12,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,809 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:32:12,810 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:32:12,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,842 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:32:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,844 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:32:12,844 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:32:12,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:12,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:12,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,894 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:32:12,895 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:32:12,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:12,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:12,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:12,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,944 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:32:12,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:12,945 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:32:12,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:12,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:12,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:12,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:12,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:12,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:12,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:12,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:12,995 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:32:13,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:32:13,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:13,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:13,006 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:13,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:32:13,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:13,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:13,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:13,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:13,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:13,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:13,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:13,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:13,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:13,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:13,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:13,055 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:32:13,061 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:32:13,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:13,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:13,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:13,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:13,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:13,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:13,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:13,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:13,102 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:32:13,102 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:32:13,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:13,111 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:32:13,164 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:13,171 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:32:13,185 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:13,185 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:13,185 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 + 1 Supporting invariants [] [2022-02-21 03:32:13,231 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:32:13,280 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:32:13,287 INFO L390 LassoCheck]: Loop: "call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume !test_fun_#t~short8#1;" "assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" [2022-02-21 03:32:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:32:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:13,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {147#unseeded} is VALID [2022-02-21 03:32:13,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {216#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) unseeded)} is VALID [2022-02-21 03:32:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:32:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:13,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:13,489 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 25 [2022-02-21 03:32:13,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (>= oldRank0 (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) 1)))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {228#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1)))} is VALID [2022-02-21 03:32:13,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1)))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:13,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:13,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} assume !test_fun_#t~short8#1; {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:13,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:13,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2) 1) oldRank0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {219#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) 1)))))} is VALID [2022-02-21 03:32:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:13,579 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:32:13,592 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:32:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:32:13,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 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:32:13,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. 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) Result 22 states and 29 transitions. Complement of second has 6 states. [2022-02-21 03:32:13,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:13,709 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:13,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 03:32:13,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:13,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:13,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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:32:13,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:13,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:13,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:13,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2022-02-21 03:32:13,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:13,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:13,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:13,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 4 [2022-02-21 03:32:13,720 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:32:13,720 INFO L70 LassoExtractor]: Start lassoExtractor. 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:32:13,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:13,722 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:13,722 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 29 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:13,723 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:32:13,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,727 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:32:13,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:32:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:32:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:32:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:32:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:32:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:32:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:32:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:32:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:32:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:32:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:32:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:32:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:32:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:13,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:13,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 10 letters. [2022-02-21 03:32:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 10 letters. [2022-02-21 03:32:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 10 letters. [2022-02-21 03:32:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,746 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. 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:32:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:32:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:32:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:32:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:32:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:13,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:13,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:13,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 28 transitions. [2022-02-21 03:32:13,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:13,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:13,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2022-02-21 03:32:13,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:13,750 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-02-21 03:32:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2022-02-21 03:32:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-02-21 03:32:13,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:13,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 28 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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:32:13,752 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 28 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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:32:13,752 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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:32:13,752 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:13,754 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-02-21 03:32:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:32:13,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:13,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:13,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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 28 transitions. [2022-02-21 03:32:13,755 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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 28 transitions. [2022-02-21 03:32:13,755 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:13,756 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-02-21 03:32:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:32:13,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:13,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:13,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:13,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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:32:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-02-21 03:32:13,757 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:32:13,758 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:32:13,758 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:13,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:32:13,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:13,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:13,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:13,758 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:32:13,758 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:13,759 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 287#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 289#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 285#L555-5 [2022-02-21 03:32:13,759 INFO L793 eck$LassoCheckResult]: Loop: 285#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 291#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 279#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 280#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 285#L555-5 [2022-02-21 03:32:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-02-21 03:32:13,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:13,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413744161] [2022-02-21 03:32:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:13,783 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:13,794 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 1 times [2022-02-21 03:32:13,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:13,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883406401] [2022-02-21 03:32:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:13,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:13,822 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 179565776, now seen corresponding path program 1 times [2022-02-21 03:32:13,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:13,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548123668] [2022-02-21 03:32:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:13,876 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:32:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:13,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:13,943 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:14,445 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:14,445 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:14,445 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:14,445 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:14,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:14,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:14,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:14,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:14,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration4_Lasso [2022-02-21 03:32:14,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:14,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:14,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,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:32:14,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:14,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:15,231 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:15,231 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:15,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,235 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:32:15,236 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:32:15,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:15,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:15,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:15,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:15,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:15,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:15,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:15,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:15,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:15,271 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:32:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,272 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:32:15,274 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:32:15,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:15,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:15,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:15,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:15,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:15,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:15,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:15,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:15,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:15,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:32:15,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,298 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:32:15,298 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:32:15,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:15,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:15,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:15,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:15,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:15,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:15,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:15,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:15,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:15,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,329 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:32:15,330 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:32:15,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:15,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:15,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:15,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:15,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:15,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:15,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:15,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:15,392 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:32:15,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,393 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:32:15,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:15,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:15,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:15,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:15,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:15,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:15,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:15,413 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:32:15,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:15,439 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:32:15,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,440 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:32:15,441 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:32:15,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:15,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:15,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:15,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:15,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:15,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:15,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:15,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:15,481 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:32:15,481 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:32:15,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,484 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:32:15,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:15,500 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:32:15,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:15,516 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:15,516 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 + 2147483647 Supporting invariants [] [2022-02-21 03:32:15,534 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:32:15,582 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:32:15,586 INFO L390 LassoCheck]: Loop: "call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" [2022-02-21 03:32:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:15,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:15,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:15,638 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:32:15,638 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {382#unseeded} is VALID [2022-02-21 03:32:15,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {382#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {382#unseeded} is VALID [2022-02-21 03:32:15,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {382#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {382#unseeded} is VALID [2022-02-21 03:32:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:15,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:15,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:15,807 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:32:15,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {385#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:15,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {467#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} is VALID [2022-02-21 03:32:15,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {471#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:15,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {450#(or (and (>= oldRank0 0) (> oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:32:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:15,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,825 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:32:15,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:32:15,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 57 transitions. Complement of second has 9 states. [2022-02-21 03:32:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:15,889 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:15,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:15,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:15,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:15,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:15,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:15,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:15,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2022-02-21 03:32:15,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:15,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:15,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:15,891 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:15,892 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:15,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:15,892 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:15,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 57 transitions. cyclomatic complexity: 19 [2022-02-21 03:32:15,893 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:15,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:15,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:15,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:32:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:32:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:32:15,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:15,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:15,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:15,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:15,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:15,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:15,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:15,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:15,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:15,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:15,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:15,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:15,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:15,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:15,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:15,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:15,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:15,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:15,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:32:15,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:32:15,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:32:15,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:32:15,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:32:15,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:32:15,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:32:15,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:32:15,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:32:15,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,907 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-21 03:32:15,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:15,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:15,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2022-02-21 03:32:15,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:15,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. cyclomatic complexity: 19 [2022-02-21 03:32:15,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:15,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 30 states and 40 transitions. [2022-02-21 03:32:15,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:15,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:32:15,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:32:15,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:15,917 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:32:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:32:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-02-21 03:32:15,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:15,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,921 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,921 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,921 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:15,923 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-02-21 03:32:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-21 03:32:15,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:15,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:15,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 30 states and 40 transitions. [2022-02-21 03:32:15,924 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 30 states and 40 transitions. [2022-02-21 03:32:15,924 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:15,932 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-02-21 03:32:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-21 03:32:15,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:15,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:15,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:15,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-21 03:32:15,935 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-21 03:32:15,935 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-21 03:32:15,935 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:32:15,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2022-02-21 03:32:15,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:15,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:15,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:15,937 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:15,937 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:15,938 INFO L791 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 531#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 537#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 538#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 544#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 553#L555-1 assume !test_fun_#t~short8#1; 534#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 535#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 536#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 540#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 541#L555-5 [2022-02-21 03:32:15,938 INFO L793 eck$LassoCheckResult]: Loop: 541#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 545#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 532#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 533#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 541#L555-5 [2022-02-21 03:32:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 765810429, now seen corresponding path program 2 times [2022-02-21 03:32:15,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:15,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104560535] [2022-02-21 03:32:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:15,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:15,974 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 2 times [2022-02-21 03:32:15,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:15,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863339197] [2022-02-21 03:32:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:15,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:15,988 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1660970651, now seen corresponding path program 1 times [2022-02-21 03:32:15,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:15,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048444896] [2022-02-21 03:32:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:16,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {687#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {687#true} is VALID [2022-02-21 03:32:16,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:16,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:16,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {690#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:16,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {690#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {691#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1)))} is VALID [2022-02-21 03:32:16,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {691#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1)))} assume !test_fun_#t~short8#1; {692#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:16,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {692#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {692#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:16,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {692#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {693#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))} is VALID [2022-02-21 03:32:16,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {693#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))} is VALID [2022-02-21 03:32:16,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {694#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:16,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {695#(not |ULTIMATE.start_test_fun_#t~short8#1|)} is VALID [2022-02-21 03:32:16,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {695#(not |ULTIMATE.start_test_fun_#t~short8#1|)} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {688#false} is VALID [2022-02-21 03:32:16,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {688#false} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {688#false} is VALID [2022-02-21 03:32:16,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#false} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {688#false} is VALID [2022-02-21 03:32:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:16,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:16,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048444896] [2022-02-21 03:32:16,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048444896] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:16,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623014125] [2022-02-21 03:32:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:16,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:16,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,121 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:32:16,122 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:32:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:16,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-21 03:32:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:16,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:16,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-21 03:32:16,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:32:16,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-02-21 03:32:16,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-02-21 03:32:16,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-02-21 03:32:17,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-02-21 03:32:17,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {687#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {687#true} is VALID [2022-02-21 03:32:17,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:17,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:17,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {708#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:17,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {708#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {712#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:17,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !test_fun_#t~short8#1; {716#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:17,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {716#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {716#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:17,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {723#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:17,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {723#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:17,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {693#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))} is VALID [2022-02-21 03:32:17,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {693#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {733#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not |ULTIMATE.start_test_fun_#t~short8#1|))))} is VALID [2022-02-21 03:32:17,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not |ULTIMATE.start_test_fun_#t~short8#1|))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {737#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:17,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {737#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {741#(< |ULTIMATE.start_test_fun_#t~mem9#1| 0)} is VALID [2022-02-21 03:32:17,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {741#(< |ULTIMATE.start_test_fun_#t~mem9#1| 0)} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {688#false} is VALID [2022-02-21 03:32:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:17,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:18,654 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-02-21 03:32:18,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 72 [2022-02-21 03:32:18,714 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-02-21 03:32:18,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 93 treesize of output 69 [2022-02-21 03:32:18,738 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-21 03:32:18,738 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 27 treesize of output 22 [2022-02-21 03:32:18,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {745#(<= |ULTIMATE.start_test_fun_#t~mem9#1| 0)} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {688#false} is VALID [2022-02-21 03:32:18,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {745#(<= |ULTIMATE.start_test_fun_#t~mem9#1| 0)} is VALID [2022-02-21 03:32:18,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#(or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not |ULTIMATE.start_test_fun_#t~short8#1|))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {749#(<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)} is VALID [2022-02-21 03:32:18,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {757#(or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {753#(or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not |ULTIMATE.start_test_fun_#t~short8#1|))} is VALID [2022-02-21 03:32:18,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {761#(forall ((v_ArrVal_191 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {757#(or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0))} is VALID [2022-02-21 03:32:18,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {761#(forall ((v_ArrVal_191 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {761#(forall ((v_ArrVal_191 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)))} is VALID [2022-02-21 03:32:18,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#(forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {761#(forall ((v_ArrVal_191 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)))} is VALID [2022-02-21 03:32:18,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#(forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {768#(forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:18,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#(or |ULTIMATE.start_test_fun_#t~short8#1| (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))} assume !test_fun_#t~short8#1; {768#(forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:18,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {779#(forall ((|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {775#(or |ULTIMATE.start_test_fun_#t~short8#1| (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))} is VALID [2022-02-21 03:32:18,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {779#(forall ((|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_189 Int)) (or (<= (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (<= (+ v_ArrVal_189 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_189)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_191) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_191 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))))} is VALID [2022-02-21 03:32:18,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:18,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {689#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:18,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {687#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {687#true} is VALID [2022-02-21 03:32:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:18,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623014125] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:18,921 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:18,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2022-02-21 03:32:18,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114086372] [2022-02-21 03:32:18,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:19,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:19,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:32:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=431, Unknown=2, NotChecked=0, Total=552 [2022-02-21 03:32:19,056 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 12 Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:19,384 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-02-21 03:32:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:32:19,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:19,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 33 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:19,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2022-02-21 03:32:19,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 41 transitions. [2022-02-21 03:32:19,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:32:19,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:32:19,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2022-02-21 03:32:19,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:19,443 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-02-21 03:32:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2022-02-21 03:32:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2022-02-21 03:32:19,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:19,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 41 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:19,448 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 41 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:19,449 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:19,449 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:19,451 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-21 03:32:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-21 03:32:19,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:19,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:19,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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 36 states and 41 transitions. [2022-02-21 03:32:19,451 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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 36 states and 41 transitions. [2022-02-21 03:32:19,452 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:19,454 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-21 03:32:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-21 03:32:19,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:19,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:19,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:19,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-21 03:32:19,456 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-21 03:32:19,456 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-21 03:32:19,456 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:32:19,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2022-02-21 03:32:19,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,457 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:19,457 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:19,457 INFO L791 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 863#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 864#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 870#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 873#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 857#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 858#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 862#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 871#L555-1 assume !test_fun_#t~short8#1; 872#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 859#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 860#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 866#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 861#L555-5 [2022-02-21 03:32:19,457 INFO L793 eck$LassoCheckResult]: Loop: 861#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 867#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 855#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 856#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 861#L555-5 [2022-02-21 03:32:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2109612571, now seen corresponding path program 2 times [2022-02-21 03:32:19,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:19,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187146208] [2022-02-21 03:32:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:19,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:19,502 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 3 times [2022-02-21 03:32:19,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:19,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630288814] [2022-02-21 03:32:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:19,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:19,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1330746291, now seen corresponding path program 3 times [2022-02-21 03:32:19,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:19,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112618723] [2022-02-21 03:32:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {1027#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1027#true} is VALID [2022-02-21 03:32:19,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1029#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} is VALID [2022-02-21 03:32:19,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {1029#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1029#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} is VALID [2022-02-21 03:32:19,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {1029#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1030#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} is VALID [2022-02-21 03:32:19,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {1030#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1031#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:19,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1031#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:19,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1031#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:19,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1032#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} is VALID [2022-02-21 03:32:19,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1033#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} is VALID [2022-02-21 03:32:19,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))} assume !test_fun_#t~short8#1; {1034#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2))} is VALID [2022-02-21 03:32:19,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {1034#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {1034#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2))} is VALID [2022-02-21 03:32:19,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {1034#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {1035#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:19,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1035#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:19,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1035#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1035#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:19,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1036#(and (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not |ULTIMATE.start_test_fun_#t~short8#1|)))} is VALID [2022-02-21 03:32:19,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {1036#(and (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not |ULTIMATE.start_test_fun_#t~short8#1|)))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1037#(and (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0))} is VALID [2022-02-21 03:32:19,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1037#(and (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1038#(and (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#t~mem9#1| 0))} is VALID [2022-02-21 03:32:19,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#(and (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#t~mem9#1| 0))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1028#false} is VALID [2022-02-21 03:32:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:19,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:19,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112618723] [2022-02-21 03:32:19,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112618723] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:32:19,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989566223] [2022-02-21 03:32:19,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:32:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:19,752 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:32:19,759 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:32:19,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 03:32:19,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:32:19,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-21 03:32:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:19,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-21 03:32:19,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:32:20,002 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 28 treesize of output 16 [2022-02-21 03:32:20,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-02-21 03:32:20,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-02-21 03:32:20,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-02-21 03:32:21,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-02-21 03:32:21,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1027#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1027#true} is VALID [2022-02-21 03:32:21,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:21,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:21,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:21,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:21,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:21,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} is VALID [2022-02-21 03:32:21,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1065#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (- (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1))} is VALID [2022-02-21 03:32:21,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {1065#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (- (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1069#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (<= (div (- (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1))} is VALID [2022-02-21 03:32:21,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (<= (div (- (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1))} assume !test_fun_#t~short8#1; {1073#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:21,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {1073#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {1073#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:21,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {1073#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {1080#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:21,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {1080#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1080#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:21,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {1080#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 2)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1087#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (+ (- 1) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (- 2)) 1))} is VALID [2022-02-21 03:32:21,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {1087#(and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (+ (- 1) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (- 2)) 1))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1091#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (+ (- 1) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (- 2)) 1) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not |ULTIMATE.start_test_fun_#t~short8#1|))))} is VALID [2022-02-21 03:32:21,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (div (+ (- 1) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (- 2)) 1) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not |ULTIMATE.start_test_fun_#t~short8#1|))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1095#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (div (+ (- 1) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (- 2)) 1)))} is VALID [2022-02-21 03:32:21,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1095#(exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (div (+ (- 1) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (- 2)) 1)))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1099#(< (div (+ (- 2) (* (- 1) |ULTIMATE.start_test_fun_#t~mem9#1|)) (- 2)) 2)} is VALID [2022-02-21 03:32:21,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(< (div (+ (- 2) (* (- 1) |ULTIMATE.start_test_fun_#t~mem9#1|)) (- 2)) 2)} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1028#false} is VALID [2022-02-21 03:32:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:21,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:32:22,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select v_ArrVal_262 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (<= (div (+ (- 4) (* .cse0 (- 1))) (- 2)) 2) (<= (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse0) (not (<= v_ArrVal_258 (* 2 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))) (< v_ArrVal_258 .cse4) (not (<= (+ v_ArrVal_261 1) .cse4)))))))) is different from false [2022-02-21 03:32:24,751 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-02-21 03:32:24,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 72 [2022-02-21 03:32:24,813 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-02-21 03:32:24,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 95 treesize of output 71 [2022-02-21 03:32:24,861 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-21 03:32:24,864 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 33 treesize of output 28 [2022-02-21 03:32:25,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(< (div (+ (- 2) (* (- 1) |ULTIMATE.start_test_fun_#t~mem9#1|)) (- 2)) 2)} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1028#false} is VALID [2022-02-21 03:32:25,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {1106#(<= (div (+ (- 4) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (- 2)) 2)} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1099#(< (div (+ (- 2) (* (- 1) |ULTIMATE.start_test_fun_#t~mem9#1|)) (- 2)) 2)} is VALID [2022-02-21 03:32:25,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#(or (<= (div (+ (- 4) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (- 2)) 2) (not |ULTIMATE.start_test_fun_#t~short8#1|))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1106#(<= (div (+ (- 4) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (- 2)) 2)} is VALID [2022-02-21 03:32:25,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {1114#(or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (div (+ (- 4) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (- 2)) 2))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1110#(or (<= (div (+ (- 4) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (- 2)) 2) (not |ULTIMATE.start_test_fun_#t~short8#1|))} is VALID [2022-02-21 03:32:25,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {1118#(forall ((v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1114#(or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= (div (+ (- 4) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (- 2)) 2))} is VALID [2022-02-21 03:32:25,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {1118#(forall ((v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1118#(forall ((v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:25,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#(forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {1118#(forall ((v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:25,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {1125#(forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {1125#(forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))} is VALID [2022-02-21 03:32:25,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1132#(or |ULTIMATE.start_test_fun_#t~short8#1| (forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))} assume !test_fun_#t~short8#1; {1125#(forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))} is VALID [2022-02-21 03:32:25,265 WARN L290 TraceCheckUtils]: 8: Hoare triple {1136#(forall ((|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (or (forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1132#(or |ULTIMATE.start_test_fun_#t~short8#1| (forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))} is UNKNOWN [2022-02-21 03:32:25,270 WARN L290 TraceCheckUtils]: 7: Hoare triple {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1136#(forall ((|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int)) (or (forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (<= (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= (+ v_ArrVal_261 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))} is UNKNOWN [2022-02-21 03:32:25,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} is VALID [2022-02-21 03:32:25,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} is VALID [2022-02-21 03:32:25,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} is VALID [2022-02-21 03:32:25,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1140#(forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (or (<= (div (+ (* (- 1) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (- 4)) (- 2)) 2) (not (<= (+ v_ArrVal_261 1) (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< v_ArrVal_258 (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= (select (select (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select v_ArrVal_262 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (<= v_ArrVal_258 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2)))))} is VALID [2022-02-21 03:32:25,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:25,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1045#(not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))} is VALID [2022-02-21 03:32:25,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {1027#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1027#true} is VALID [2022-02-21 03:32:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-02-21 03:32:25,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989566223] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:32:25,293 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:32:25,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-02-21 03:32:25,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940103213] [2022-02-21 03:32:25,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:32:25,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-21 03:32:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=675, Unknown=1, NotChecked=54, Total=870 [2022-02-21 03:32:25,430 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:26,076 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-02-21 03:32:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:32:26,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 43 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:26,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2022-02-21 03:32:26,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:26,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 47 states and 52 transitions. [2022-02-21 03:32:26,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:32:26,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:32:26,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 52 transitions. [2022-02-21 03:32:26,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:26,154 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-02-21 03:32:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 52 transitions. [2022-02-21 03:32:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-02-21 03:32:26,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:26,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 52 transitions. Second operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,156 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 52 transitions. Second operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,156 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,157 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:26,158 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-02-21 03:32:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-02-21 03:32:26,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:26,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:26,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 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 47 states and 52 transitions. [2022-02-21 03:32:26,159 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 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 47 states and 52 transitions. [2022-02-21 03:32:26,160 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:26,161 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-02-21 03:32:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-02-21 03:32:26,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:26,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:26,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:26,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-21 03:32:26,163 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-21 03:32:26,163 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-21 03:32:26,163 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:32:26,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2022-02-21 03:32:26,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:26,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:26,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:26,164 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:32:26,164 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:26,165 INFO L791 eck$LassoCheckResult]: Stem: 1236#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1247#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1248#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1253#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 1260#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 1259#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1245#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1246#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 1252#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 1240#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1241#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1258#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 1255#L555-1 assume !test_fun_#t~short8#1; 1254#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 1242#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1243#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 1250#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1244#L555-5 [2022-02-21 03:32:26,165 INFO L793 eck$LassoCheckResult]: Loop: 1244#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 1251#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 1238#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1239#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1244#L555-5 [2022-02-21 03:32:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 4 times [2022-02-21 03:32:26,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:26,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396808175] [2022-02-21 03:32:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:26,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:26,211 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 4 times [2022-02-21 03:32:26,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:26,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841761813] [2022-02-21 03:32:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:26,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:26,226 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash -647394507, now seen corresponding path program 5 times [2022-02-21 03:32:26,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:26,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147632608] [2022-02-21 03:32:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:26,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:26,276 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:27,685 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:27,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:27,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:27,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:27,685 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:27,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:27,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:27,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration7_Lasso [2022-02-21 03:32:27,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:27,686 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:27,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:28,353 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:28,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,356 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:32:28,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:28,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:28,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:28,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:28,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,382 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:32:28,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:28,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:28,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:28,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:32:28,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,417 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:32:28,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:28,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:28,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:28,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,486 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:32:28,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:28,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:28,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:32:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,533 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:32:28,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:28,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:28,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:28,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:32:28,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,576 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:32:28,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:28,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:28,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:28,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,606 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:32:28,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:28,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:28,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:28,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:28,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,632 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:32:28,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:28,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:28,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:28,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,684 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:32:28,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:28,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:28,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:28,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:32:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,715 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:32:28,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:28,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:28,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:28,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:28,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:28,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:28,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:28,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:28,754 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:32:28,754 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:32:28,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,756 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:28,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:32:28,760 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:28,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:28,768 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:28,768 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3 + 2147483647 Supporting invariants [] [2022-02-21 03:32:28,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:28,824 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:32:28,827 INFO L390 LassoCheck]: Loop: "call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" [2022-02-21 03:32:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:28,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:28,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:28,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1465#unseeded} is VALID [2022-02-21 03:32:28,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#unseeded} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1465#unseeded} is VALID [2022-02-21 03:32:28,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#unseeded} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#unseeded} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#unseeded} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1465#unseeded} is VALID [2022-02-21 03:32:28,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#unseeded} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#unseeded} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#unseeded} assume !test_fun_#t~short8#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#unseeded} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#unseeded} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {1465#unseeded} is VALID [2022-02-21 03:32:28,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:28,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:29,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:29,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:29,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1592#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} is VALID [2022-02-21 03:32:29,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {1592#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1596#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:29,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {1596#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1533#(or (and (>= oldRank0 0) (> oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:32:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:29,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:29,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:32:29,121 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Result 45 states and 52 transitions. Complement of second has 9 states. [2022-02-21 03:32:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:29,183 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:29,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:29,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2022-02-21 03:32:29,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,186 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 39 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:29,187 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:29,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:29,188 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:32:29,189 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:29,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,204 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-21 03:32:29,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,207 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:29,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1465#unseeded} is VALID [2022-02-21 03:32:29,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#unseeded} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1465#unseeded} is VALID [2022-02-21 03:32:29,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#unseeded} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#unseeded} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#unseeded} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1465#unseeded} is VALID [2022-02-21 03:32:29,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#unseeded} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#unseeded} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#unseeded} assume !test_fun_#t~short8#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#unseeded} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#unseeded} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:29,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:29,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1716#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} is VALID [2022-02-21 03:32:29,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1716#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1720#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:29,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {1720#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1533#(or (and (>= oldRank0 0) (> oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:32:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:29,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:29,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,422 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:32:29,422 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,478 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Result 45 states and 52 transitions. Complement of second has 9 states. [2022-02-21 03:32:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:29,479 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:29,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:29,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2022-02-21 03:32:29,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,483 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 39 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:29,483 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:29,483 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,483 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:29,484 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:32:29,487 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:29,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:29,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:29,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:29,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 52 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,498 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-21 03:32:29,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,499 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:29,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1465#unseeded} is VALID [2022-02-21 03:32:29,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#unseeded} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1465#unseeded} is VALID [2022-02-21 03:32:29,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#unseeded} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#unseeded} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#unseeded} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1465#unseeded} is VALID [2022-02-21 03:32:29,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#unseeded} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#unseeded} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#unseeded} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#unseeded} assume !test_fun_#t~short8#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#unseeded} assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#unseeded} call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {1465#unseeded} is VALID [2022-02-21 03:32:29,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#unseeded} call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#unseeded} assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1465#unseeded} is VALID [2022-02-21 03:32:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:29,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} is VALID [2022-02-21 03:32:29,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1468#(>= oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))} assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; {1840#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} is VALID [2022-02-21 03:32:29,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {1840#(and (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (not |ULTIMATE.start_test_fun_#t~short8#1|)) (>= oldRank0 (+ 2147483647 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (- 2)))))} assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); {1844#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:29,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {1844#(and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1073741824) (<= 2147483647 (+ oldRank0 (* (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2))) (<= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; {1533#(or (and (>= oldRank0 0) (> oldRank0 (+ 2147483647 (* (- 2) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:32:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:29,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:29,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,749 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:32:29,749 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Result 55 states and 66 transitions. Complement of second has 8 states. [2022-02-21 03:32:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:29,803 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:29,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:29,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2022-02-21 03:32:29,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:29,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:29,805 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 39 transitions. cyclomatic complexity: 8 [2022-02-21 03:32:29,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:29,806 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:29,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:29,806 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 66 transitions. cyclomatic complexity: 14 [2022-02-21 03:32:29,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. cyclomatic complexity: 14 [2022-02-21 03:32:29,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:29,807 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:29,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:32:29,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:32:29,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:32:29,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:32:29,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:29,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:32:29,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:32:29,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:32:29,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:32:29,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,815 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:32:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-21 03:32:29,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:29,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:32:29,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:32:29,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:29,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. cyclomatic complexity: 14 [2022-02-21 03:32:29,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:29,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-02-21 03:32:29,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:29,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:29,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:29,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:29,819 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:29,819 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:29,819 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:29,819 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:32:29,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:29,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:29,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:29,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:29 BoogieIcfgContainer [2022-02-21 03:32:29,825 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:29,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:29,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:29,826 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:29,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:09" (3/4) ... [2022-02-21 03:32:29,828 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:29,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:29,829 INFO L158 Benchmark]: Toolchain (without parser) took 20903.81ms. Allocated memory was 90.2MB in the beginning and 237.0MB in the end (delta: 146.8MB). Free memory was 56.7MB in the beginning and 105.9MB in the end (delta: -49.2MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2022-02-21 03:32:29,829 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:29,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.10ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 59.0MB in the end (delta: -2.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:29,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.32ms. Allocated memory is still 90.2MB. Free memory was 58.8MB in the beginning and 57.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:29,830 INFO L158 Benchmark]: Boogie Preprocessor took 20.71ms. Allocated memory is still 90.2MB. Free memory was 57.0MB in the beginning and 55.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:29,830 INFO L158 Benchmark]: RCFGBuilder took 385.86ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.5MB in the beginning and 89.8MB in the end (delta: -34.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:29,831 INFO L158 Benchmark]: BuchiAutomizer took 20059.37ms. Allocated memory was 113.2MB in the beginning and 237.0MB in the end (delta: 123.7MB). Free memory was 89.8MB in the beginning and 107.0MB in the end (delta: -17.2MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2022-02-21 03:32:29,831 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 237.0MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:29,832 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.10ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 59.0MB in the end (delta: -2.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.32ms. Allocated memory is still 90.2MB. Free memory was 58.8MB in the beginning and 57.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.71ms. Allocated memory is still 90.2MB. Free memory was 57.0MB in the beginning and 55.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 385.86ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 55.5MB in the beginning and 89.8MB in the end (delta: -34.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 20059.37ms. Allocated memory was 113.2MB in the beginning and 237.0MB in the end (delta: 123.7MB). Free memory was 89.8MB in the beginning and 107.0MB in the end (delta: -17.2MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 237.0MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 4 locations. One deterministic module has affine ranking function 2147483647 + -2 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. One nondeterministic module has affine ranking function 2147483647 + -2 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 30 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 16.7s. Construction of modules took 0.4s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 101 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 58 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax106 hnf100 lsp89 ukn54 mio100 lsp36 div100 bol100 ite100 ukn100 eq170 hnf89 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:32:29,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-02-21 03:32:30,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-02-21 03:32:30,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE