./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows 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/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ef201cd54bcdc81a1760f6e60d88bd9cc04c6c00c0d7306b10fb5fb0b61b4e06 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:48,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:48,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:48,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:48,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:48,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:48,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:48,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:48,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:48,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:48,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:48,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:48,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:48,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:48,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:48,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:48,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:48,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:48,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:48,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:48,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:48,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:48,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:48,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:48,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:48,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:48,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:48,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:48,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:48,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:48,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:48,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:48,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:48,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:48,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:48,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:48,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:48,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:48,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:48,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:48,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:48,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:48,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:48,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:48,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:48,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:48,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:48,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:48,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:48,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:48,816 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:48,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:48,817 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:48,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:48,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:48,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:48,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:48,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:48,818 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:48,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:48,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:48,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:48,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:48,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:48,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:48,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:48,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:48,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:48,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:48,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:48,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:48,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:48,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! overflow) ) 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 -> ef201cd54bcdc81a1760f6e60d88bd9cc04c6c00c0d7306b10fb5fb0b61b4e06 [2022-02-21 03:04:49,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:49,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:49,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:49,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:49,028 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:49,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d.c [2022-02-21 03:04:49,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd916c60a/371d5a3ab3cc415d9e2075245d6bbb64/FLAGcc43e2189 [2022-02-21 03:04:49,434 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:49,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d.c [2022-02-21 03:04:49,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd916c60a/371d5a3ab3cc415d9e2075245d6bbb64/FLAGcc43e2189 [2022-02-21 03:04:49,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd916c60a/371d5a3ab3cc415d9e2075245d6bbb64 [2022-02-21 03:04:49,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:49,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:49,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:49,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:49,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:49,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216dcf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49, skipping insertion in model container [2022-02-21 03:04:49,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:49,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:49,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:49,639 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:49,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:49,661 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:49,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49 WrapperNode [2022-02-21 03:04:49,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:49,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:49,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:49,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:49,672 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:04:49" (1/1) ... [2022-02-21 03:04:49,676 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:04:49" (1/1) ... [2022-02-21 03:04:49,692 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2022-02-21 03:04:49,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:49,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:49,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:49,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:49,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:49,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:49,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:49,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:49,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (1/1) ... [2022-02-21 03:04:49,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:49,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:49,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:49,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:49,812 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:49,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:49,937 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:49,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:49,949 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:04:49,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:49 BoogieIcfgContainer [2022-02-21 03:04:49,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:49,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:49,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:49,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:49,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:49" (1/3) ... [2022-02-21 03:04:49,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bfd53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:49, skipping insertion in model container [2022-02-21 03:04:49,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:49" (2/3) ... [2022-02-21 03:04:49,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bfd53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:49, skipping insertion in model container [2022-02-21 03:04:49,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:49" (3/3) ... [2022-02-21 03:04:49,975 INFO L111 eAbstractionObserver]: Analyzing ICFG ChawdharyCookGulwaniSagivYang-ESOP2008-random2d.c [2022-02-21 03:04:49,979 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:49,979 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:04:50,059 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:50,065 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:50,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:04:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:04:50,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:50,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:04:50,096 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:04:50,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:50,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270143418] [2022-02-21 03:04:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true; {35#true} is VALID [2022-02-21 03:04:50,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {37#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:50,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {37#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:50,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(1 + main_~i~0#1 <= 2147483647); {36#false} is VALID [2022-02-21 03:04:50,291 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:04:50,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:50,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270143418] [2022-02-21 03:04:50,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270143418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:50,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:50,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:50,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758349101] [2022-02-21 03:04:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:04:50,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:50,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,308 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:04:50,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:50,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:50,328 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,444 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-02-21 03:04:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:50,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:04:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-21 03:04:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-21 03:04:50,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-02-21 03:04:50,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,518 INFO L225 Difference]: With dead ends: 44 [2022-02-21 03:04:50,518 INFO L226 Difference]: Without dead ends: 31 [2022-02-21 03:04:50,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:50,524 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:50,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-21 03:04:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-21 03:04:50,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:50,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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:04:50,551 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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:04:50,551 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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:04:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,554 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:04:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:04:50,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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 31 states. [2022-02-21 03:04:50,556 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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 31 states. [2022-02-21 03:04:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,559 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:04:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:04:50,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:50,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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:04:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-02-21 03:04:50,571 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 4 [2022-02-21 03:04:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:50,571 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-02-21 03:04:50,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:04:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:50,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:50,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:50,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:50,573 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:04:50,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:50,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296770621] [2022-02-21 03:04:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true; {183#true} is VALID [2022-02-21 03:04:50,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {185#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:04:50,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {185#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:04:50,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {185#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {185#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:04:50,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {185#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(1 + main_~i~0#1 >= -2147483648); {184#false} is VALID [2022-02-21 03:04:50,611 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:04:50,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:50,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296770621] [2022-02-21 03:04:50,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296770621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:50,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:50,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:50,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030728484] [2022-02-21 03:04:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:50,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:50,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:50,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04:50,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:50,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:50,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:50,632 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,681 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 03:04:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:50,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:04:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:04:50,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-21 03:04:50,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,721 INFO L225 Difference]: With dead ends: 30 [2022-02-21 03:04:50,722 INFO L226 Difference]: Without dead ends: 29 [2022-02-21 03:04:50,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:50,723 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:50,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-21 03:04:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-21 03:04:50,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:50,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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:04:50,733 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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:04:50,733 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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:04:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,738 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:04:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:04:50,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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 29 states. [2022-02-21 03:04:50,742 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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 29 states. [2022-02-21 03:04:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,744 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:04:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:04:50,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:50,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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:04:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-21 03:04:50,754 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 5 [2022-02-21 03:04:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:50,754 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:04:50,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:04:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:04:50,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:50,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:50,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:50,755 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash 294944169, now seen corresponding path program 1 times [2022-02-21 03:04:50,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:50,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818868331] [2022-02-21 03:04:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} assume { :begin_inline_ULTIMATE.init } true; {309#true} is VALID [2022-02-21 03:04:50,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:50,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:50,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:50,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:50,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:50,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 0 == main_~r~0#1; {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:50,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {311#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !(1 + main_~x~0#1 <= 2147483647); {310#false} is VALID [2022-02-21 03:04:50,800 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:04:50,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:50,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818868331] [2022-02-21 03:04:50,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818868331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:50,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:50,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:50,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643072187] [2022-02-21 03:04:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:04:50,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:50,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,810 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:04:50,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:50,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:50,811 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,868 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-02-21 03:04:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:04:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:50,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:04:50,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,920 INFO L225 Difference]: With dead ends: 52 [2022-02-21 03:04:50,920 INFO L226 Difference]: Without dead ends: 50 [2022-02-21 03:04:50,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:50,922 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:50,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-21 03:04:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-02-21 03:04:50,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:50,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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:04:50,932 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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:04:50,933 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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:04:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,935 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-21 03:04:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-21 03:04:50,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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 50 states. [2022-02-21 03:04:50,936 INFO L87 Difference]: Start difference. First operand has 44 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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 50 states. [2022-02-21 03:04:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,940 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-21 03:04:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-21 03:04:50,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:50,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 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:04:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-21 03:04:50,948 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 8 [2022-02-21 03:04:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:50,948 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-21 03:04:50,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-21 03:04:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:04:50,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:50,950 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:50,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:50,950 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 294981328, now seen corresponding path program 1 times [2022-02-21 03:04:50,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:50,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131330025] [2022-02-21 03:04:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {516#true} assume { :begin_inline_ULTIMATE.init } true; {516#true} is VALID [2022-02-21 03:04:50,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:50,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:50,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:51,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:51,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:51,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:51,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {517#false} is VALID [2022-02-21 03:04:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:51,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:51,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131330025] [2022-02-21 03:04:51,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131330025] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:51,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595256595] [2022-02-21 03:04:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:51,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:51,008 INFO L229 MonitoredProcess]: Starting monitored process 2 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:04:51,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:04:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:51,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:51,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:51,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {516#true} assume { :begin_inline_ULTIMATE.init } true; {516#true} is VALID [2022-02-21 03:04:51,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:51,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:51,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:51,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {518#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:51,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:51,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:51,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {517#false} is VALID [2022-02-21 03:04:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:51,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:51,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {517#false} is VALID [2022-02-21 03:04:51,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~N~0#1); {544#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:51,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {544#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:51,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {554#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {544#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:51,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {554#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {554#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:04:51,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~N~0#1); {554#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:04:51,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {554#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:04:51,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {516#true} assume { :begin_inline_ULTIMATE.init } true; {516#true} is VALID [2022-02-21 03:04:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:51,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595256595] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:51,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:51,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:51,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012884745] [2022-02-21 03:04:51,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) Word has length 8 [2022-02-21 03:04:51,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:51,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:51,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:51,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:51,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:51,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:51,225 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,394 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2022-02-21 03:04:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) Word has length 8 [2022-02-21 03:04:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-02-21 03:04:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-02-21 03:04:51,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 122 transitions. [2022-02-21 03:04:51,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:51,524 INFO L225 Difference]: With dead ends: 147 [2022-02-21 03:04:51,524 INFO L226 Difference]: Without dead ends: 146 [2022-02-21 03:04:51,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:51,532 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:51,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 133 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-21 03:04:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2022-02-21 03:04:51,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:51,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 124 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 123 states have internal predecessors, (197), 0 states have call successors, (0), 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:04:51,566 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 124 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 123 states have internal predecessors, (197), 0 states have call successors, (0), 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:04:51,566 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 124 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 123 states have internal predecessors, (197), 0 states have call successors, (0), 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:04:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,571 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-02-21 03:04:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2022-02-21 03:04:51,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:51,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:51,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 123 states have internal predecessors, (197), 0 states have call successors, (0), 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 146 states. [2022-02-21 03:04:51,573 INFO L87 Difference]: Start difference. First operand has 124 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 123 states have internal predecessors, (197), 0 states have call successors, (0), 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 146 states. [2022-02-21 03:04:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,579 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-02-21 03:04:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2022-02-21 03:04:51,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:51,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:51,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:51,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 123 states have internal predecessors, (197), 0 states have call successors, (0), 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:04:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 197 transitions. [2022-02-21 03:04:51,585 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 197 transitions. Word has length 8 [2022-02-21 03:04:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:51,585 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 197 transitions. [2022-02-21 03:04:51,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 197 transitions. [2022-02-21 03:04:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:04:51,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:51,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:51,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:51,809 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash 553334702, now seen corresponding path program 1 times [2022-02-21 03:04:51,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:51,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110858060] [2022-02-21 03:04:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:51,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {1147#true} assume { :begin_inline_ULTIMATE.init } true; {1147#true} is VALID [2022-02-21 03:04:51,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 0 == main_~r~0#1; {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~x~0#1 <= 2147483647; {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:51,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !(1 + main_~x~0#1 >= -2147483648); {1148#false} is VALID [2022-02-21 03:04:51,843 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:04:51,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:51,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110858060] [2022-02-21 03:04:51,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110858060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:51,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:51,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:51,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11916773] [2022-02-21 03:04:51,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:04:51,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:51,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:51,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:51,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:51,851 INFO L87 Difference]: Start difference. First operand 124 states and 197 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,948 INFO L93 Difference]: Finished difference Result 213 states and 338 transitions. [2022-02-21 03:04:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:04:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:51,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:04:52,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,013 INFO L225 Difference]: With dead ends: 213 [2022-02-21 03:04:52,013 INFO L226 Difference]: Without dead ends: 211 [2022-02-21 03:04:52,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:52,018 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:52,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-21 03:04:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2022-02-21 03:04:52,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:52,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 206 states, 197 states have (on average 1.6598984771573604) internal successors, (327), 205 states have internal predecessors, (327), 0 states have call successors, (0), 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:04:52,062 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 206 states, 197 states have (on average 1.6598984771573604) internal successors, (327), 205 states have internal predecessors, (327), 0 states have call successors, (0), 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:04:52,063 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 206 states, 197 states have (on average 1.6598984771573604) internal successors, (327), 205 states have internal predecessors, (327), 0 states have call successors, (0), 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:04:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,071 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2022-02-21 03:04:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 327 transitions. [2022-02-21 03:04:52,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 197 states have (on average 1.6598984771573604) internal successors, (327), 205 states have internal predecessors, (327), 0 states have call successors, (0), 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 211 states. [2022-02-21 03:04:52,074 INFO L87 Difference]: Start difference. First operand has 206 states, 197 states have (on average 1.6598984771573604) internal successors, (327), 205 states have internal predecessors, (327), 0 states have call successors, (0), 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 211 states. [2022-02-21 03:04:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,082 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2022-02-21 03:04:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 327 transitions. [2022-02-21 03:04:52,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:52,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 197 states have (on average 1.6598984771573604) internal successors, (327), 205 states have internal predecessors, (327), 0 states have call successors, (0), 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:04:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 327 transitions. [2022-02-21 03:04:52,092 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 327 transitions. Word has length 9 [2022-02-21 03:04:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:52,093 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 327 transitions. [2022-02-21 03:04:52,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 327 transitions. [2022-02-21 03:04:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:52,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:52,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:52,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:04:52,094 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash -26301678, now seen corresponding path program 1 times [2022-02-21 03:04:52,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:52,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197826363] [2022-02-21 03:04:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {2025#true} assume { :begin_inline_ULTIMATE.init } true; {2025#true} is VALID [2022-02-21 03:04:52,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {2025#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == main_~r~0#1); {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(1 == main_~r~0#1); {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 2 == main_~r~0#1; {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:52,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {2027#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(1 + main_~y~0#1 <= 2147483647); {2026#false} is VALID [2022-02-21 03:04:52,137 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:04:52,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:52,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197826363] [2022-02-21 03:04:52,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197826363] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:52,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:52,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:52,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322965637] [2022-02-21 03:04:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:52,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:52,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:52,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:52,148 INFO L87 Difference]: Start difference. First operand 206 states and 327 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,277 INFO L93 Difference]: Finished difference Result 346 states and 547 transitions. [2022-02-21 03:04:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:52,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:52,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:04:52,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,335 INFO L225 Difference]: With dead ends: 346 [2022-02-21 03:04:52,335 INFO L226 Difference]: Without dead ends: 344 [2022-02-21 03:04:52,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:52,336 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:52,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-02-21 03:04:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2022-02-21 03:04:52,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:52,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 331 states, 322 states have (on average 1.5745341614906831) internal successors, (507), 330 states have internal predecessors, (507), 0 states have call successors, (0), 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:04:52,409 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 331 states, 322 states have (on average 1.5745341614906831) internal successors, (507), 330 states have internal predecessors, (507), 0 states have call successors, (0), 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:04:52,410 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 331 states, 322 states have (on average 1.5745341614906831) internal successors, (507), 330 states have internal predecessors, (507), 0 states have call successors, (0), 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:04:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,421 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2022-02-21 03:04:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 523 transitions. [2022-02-21 03:04:52,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 322 states have (on average 1.5745341614906831) internal successors, (507), 330 states have internal predecessors, (507), 0 states have call successors, (0), 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 344 states. [2022-02-21 03:04:52,424 INFO L87 Difference]: Start difference. First operand has 331 states, 322 states have (on average 1.5745341614906831) internal successors, (507), 330 states have internal predecessors, (507), 0 states have call successors, (0), 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 344 states. [2022-02-21 03:04:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,435 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2022-02-21 03:04:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 523 transitions. [2022-02-21 03:04:52,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:52,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 322 states have (on average 1.5745341614906831) internal successors, (507), 330 states have internal predecessors, (507), 0 states have call successors, (0), 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:04:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2022-02-21 03:04:52,447 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 10 [2022-02-21 03:04:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:52,448 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2022-02-21 03:04:52,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2022-02-21 03:04:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:04:52,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:52,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:52,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:04:52,449 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -815351945, now seen corresponding path program 1 times [2022-02-21 03:04:52,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:52,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411807646] [2022-02-21 03:04:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {3451#true} assume { :begin_inline_ULTIMATE.init } true; {3451#true} is VALID [2022-02-21 03:04:52,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(0 == main_~r~0#1); {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(1 == main_~r~0#1); {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 2 == main_~r~0#1; {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~y~0#1 <= 2147483647; {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:52,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {3453#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(1 + main_~y~0#1 >= -2147483648); {3452#false} is VALID [2022-02-21 03:04:52,494 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:04:52,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:52,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411807646] [2022-02-21 03:04:52,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411807646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:52,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:52,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:52,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712850412] [2022-02-21 03:04:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:52,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) Word has length 11 [2022-02-21 03:04:52,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:52,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:04:52,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:52,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:52,504 INFO L87 Difference]: Start difference. First operand 331 states and 507 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:04:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,661 INFO L93 Difference]: Finished difference Result 550 states and 841 transitions. [2022-02-21 03:04:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:52,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) Word has length 11 [2022-02-21 03:04:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:04:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:04:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:04:52,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:04:52,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,718 INFO L225 Difference]: With dead ends: 550 [2022-02-21 03:04:52,718 INFO L226 Difference]: Without dead ends: 548 [2022-02-21 03:04:52,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:52,719 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:52,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-02-21 03:04:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-02-21 03:04:52,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:52,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 548 states. Second operand has 543 states, 534 states have (on average 1.5149812734082397) internal successors, (809), 542 states have internal predecessors, (809), 0 states have call successors, (0), 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:04:52,819 INFO L74 IsIncluded]: Start isIncluded. First operand 548 states. Second operand has 543 states, 534 states have (on average 1.5149812734082397) internal successors, (809), 542 states have internal predecessors, (809), 0 states have call successors, (0), 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:04:52,820 INFO L87 Difference]: Start difference. First operand 548 states. Second operand has 543 states, 534 states have (on average 1.5149812734082397) internal successors, (809), 542 states have internal predecessors, (809), 0 states have call successors, (0), 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:04:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,839 INFO L93 Difference]: Finished difference Result 548 states and 809 transitions. [2022-02-21 03:04:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 809 transitions. [2022-02-21 03:04:52,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 543 states, 534 states have (on average 1.5149812734082397) internal successors, (809), 542 states have internal predecessors, (809), 0 states have call successors, (0), 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 548 states. [2022-02-21 03:04:52,842 INFO L87 Difference]: Start difference. First operand has 543 states, 534 states have (on average 1.5149812734082397) internal successors, (809), 542 states have internal predecessors, (809), 0 states have call successors, (0), 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 548 states. [2022-02-21 03:04:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,862 INFO L93 Difference]: Finished difference Result 548 states and 809 transitions. [2022-02-21 03:04:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 809 transitions. [2022-02-21 03:04:52,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:52,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 534 states have (on average 1.5149812734082397) internal successors, (809), 542 states have internal predecessors, (809), 0 states have call successors, (0), 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:04:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 809 transitions. [2022-02-21 03:04:52,882 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 809 transitions. Word has length 11 [2022-02-21 03:04:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:52,882 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 809 transitions. [2022-02-21 03:04:52,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:04:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 809 transitions. [2022-02-21 03:04:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:04:52,883 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:52,883 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:04:52,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:04:52,883 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:52,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -329510763, now seen corresponding path program 1 times [2022-02-21 03:04:52,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:52,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942920096] [2022-02-21 03:04:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {5741#true} assume { :begin_inline_ULTIMATE.init } true; {5741#true} is VALID [2022-02-21 03:04:52,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 0 == main_~r~0#1; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 <= 2147483647; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:52,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:52,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:52,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:52,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:52,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:52,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 == main_~r~0#1; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:52,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(1 + main_~x~0#1 <= 2147483647); {5742#false} is VALID [2022-02-21 03:04:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:52,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:52,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942920096] [2022-02-21 03:04:52,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942920096] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:52,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798171857] [2022-02-21 03:04:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:52,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:52,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:52,930 INFO L229 MonitoredProcess]: Starting monitored process 3 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:04:52,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:04:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:53,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {5741#true} assume { :begin_inline_ULTIMATE.init } true; {5741#true} is VALID [2022-02-21 03:04:53,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 0 == main_~r~0#1; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 <= 2147483647; {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:04:53,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {5743#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 == main_~r~0#1; {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {5744#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(1 + main_~x~0#1 <= 2147483647); {5742#false} is VALID [2022-02-21 03:04:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:53,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:53,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {5742#false} is VALID [2022-02-21 03:04:53,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 == main_~r~0#1; {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:53,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:53,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:53,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~i~0#1 <= 2147483647; {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:53,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~N~0#1); {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:53,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {5790#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:53,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 == main_~r~0#1; {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~N~0#1); {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {5809#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:53,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {5741#true} assume { :begin_inline_ULTIMATE.init } true; {5741#true} is VALID [2022-02-21 03:04:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:53,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798171857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:53,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:53,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:53,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180437457] [2022-02-21 03:04:53,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:04:53,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:53,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:53,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:53,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:53,167 INFO L87 Difference]: Start difference. First operand 543 states and 809 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:53,533 INFO L93 Difference]: Finished difference Result 1047 states and 1608 transitions. [2022-02-21 03:04:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:53,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:04:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2022-02-21 03:04:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2022-02-21 03:04:53,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 150 transitions. [2022-02-21 03:04:53,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:53,694 INFO L225 Difference]: With dead ends: 1047 [2022-02-21 03:04:53,694 INFO L226 Difference]: Without dead ends: 1045 [2022-02-21 03:04:53,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:53,695 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 142 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:53,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 115 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-02-21 03:04:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 904. [2022-02-21 03:04:53,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:53,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1045 states. Second operand has 904 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 903 states have internal predecessors, (1367), 0 states have call successors, (0), 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:04:53,859 INFO L74 IsIncluded]: Start isIncluded. First operand 1045 states. Second operand has 904 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 903 states have internal predecessors, (1367), 0 states have call successors, (0), 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:04:53,860 INFO L87 Difference]: Start difference. First operand 1045 states. Second operand has 904 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 903 states have internal predecessors, (1367), 0 states have call successors, (0), 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:04:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:53,911 INFO L93 Difference]: Finished difference Result 1045 states and 1538 transitions. [2022-02-21 03:04:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1538 transitions. [2022-02-21 03:04:53,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:53,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:53,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 904 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 903 states have internal predecessors, (1367), 0 states have call successors, (0), 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 1045 states. [2022-02-21 03:04:53,916 INFO L87 Difference]: Start difference. First operand has 904 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 903 states have internal predecessors, (1367), 0 states have call successors, (0), 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 1045 states. [2022-02-21 03:04:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:53,964 INFO L93 Difference]: Finished difference Result 1045 states and 1538 transitions. [2022-02-21 03:04:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1538 transitions. [2022-02-21 03:04:53,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:53,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:53,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:53,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 903 states have internal predecessors, (1367), 0 states have call successors, (0), 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:04:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1367 transitions. [2022-02-21 03:04:54,009 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1367 transitions. Word has length 15 [2022-02-21 03:04:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:54,009 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1367 transitions. [2022-02-21 03:04:54,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1367 transitions. [2022-02-21 03:04:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:04:54,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:54,010 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:54,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:54,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-21 03:04:54,220 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1722862724, now seen corresponding path program 1 times [2022-02-21 03:04:54,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:54,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025509041] [2022-02-21 03:04:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:54,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {10038#true} assume { :begin_inline_ULTIMATE.init } true; {10038#true} is VALID [2022-02-21 03:04:54,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {10038#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !(0 == main_~r~0#1); {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 == main_~r~0#1; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 0 == main_~r~0#1; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !(1 + main_~x~0#1 >= -2147483648); {10039#false} is VALID [2022-02-21 03:04:54,263 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:04:54,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:54,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025509041] [2022-02-21 03:04:54,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025509041] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:54,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068109453] [2022-02-21 03:04:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:54,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:54,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:04:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:54,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:54,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:54,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {10038#true} assume { :begin_inline_ULTIMATE.init } true; {10038#true} is VALID [2022-02-21 03:04:54,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {10038#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !(0 == main_~r~0#1); {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 == main_~r~0#1; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:54,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {10040#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 0 == main_~r~0#1; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:54,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {10041#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !(1 + main_~x~0#1 >= -2147483648); {10039#false} is VALID [2022-02-21 03:04:54,393 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:04:54,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:54,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume !(1 + main_~x~0#1 >= -2147483648); {10039#false} is VALID [2022-02-21 03:04:54,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume 0 == main_~r~0#1; {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {10093#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:54,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 - 1 <= 2147483647; {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume 1 == main_~r~0#1; {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !(0 == main_~r~0#1); {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume 1 + main_~i~0#1 <= 2147483647; {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !!(main_~i~0#1 < main_~N~0#1); {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {10038#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {10115#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:54,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {10038#true} assume { :begin_inline_ULTIMATE.init } true; {10038#true} is VALID [2022-02-21 03:04:54,481 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:04:54,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068109453] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:54,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:54,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:54,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652501048] [2022-02-21 03:04:54,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 03:04:54,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:54,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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:04:54,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:54,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:54,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:54,506 INFO L87 Difference]: Start difference. First operand 904 states and 1367 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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:04:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:54,989 INFO L93 Difference]: Finished difference Result 1365 states and 2106 transitions. [2022-02-21 03:04:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:54,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 03:04:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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:04:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-02-21 03:04:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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:04:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-02-21 03:04:54,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2022-02-21 03:04:55,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:55,149 INFO L225 Difference]: With dead ends: 1365 [2022-02-21 03:04:55,149 INFO L226 Difference]: Without dead ends: 1363 [2022-02-21 03:04:55,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:55,153 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 115 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:55,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 70 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-02-21 03:04:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1061. [2022-02-21 03:04:55,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:55,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1363 states. Second operand has 1061 states, 1053 states have (on average 1.5175688509021843) internal successors, (1598), 1060 states have internal predecessors, (1598), 0 states have call successors, (0), 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:04:55,394 INFO L74 IsIncluded]: Start isIncluded. First operand 1363 states. Second operand has 1061 states, 1053 states have (on average 1.5175688509021843) internal successors, (1598), 1060 states have internal predecessors, (1598), 0 states have call successors, (0), 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:04:55,395 INFO L87 Difference]: Start difference. First operand 1363 states. Second operand has 1061 states, 1053 states have (on average 1.5175688509021843) internal successors, (1598), 1060 states have internal predecessors, (1598), 0 states have call successors, (0), 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:04:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:55,471 INFO L93 Difference]: Finished difference Result 1363 states and 2031 transitions. [2022-02-21 03:04:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2031 transitions. [2022-02-21 03:04:55,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:55,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:55,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 1061 states, 1053 states have (on average 1.5175688509021843) internal successors, (1598), 1060 states have internal predecessors, (1598), 0 states have call successors, (0), 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 1363 states. [2022-02-21 03:04:55,490 INFO L87 Difference]: Start difference. First operand has 1061 states, 1053 states have (on average 1.5175688509021843) internal successors, (1598), 1060 states have internal predecessors, (1598), 0 states have call successors, (0), 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 1363 states. [2022-02-21 03:04:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:55,568 INFO L93 Difference]: Finished difference Result 1363 states and 2031 transitions. [2022-02-21 03:04:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2031 transitions. [2022-02-21 03:04:55,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:55,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:55,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:55,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1053 states have (on average 1.5175688509021843) internal successors, (1598), 1060 states have internal predecessors, (1598), 0 states have call successors, (0), 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:04:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1598 transitions. [2022-02-21 03:04:55,625 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1598 transitions. Word has length 17 [2022-02-21 03:04:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:55,627 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1598 transitions. [2022-02-21 03:04:55,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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:04:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1598 transitions. [2022-02-21 03:04:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:04:55,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:55,627 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:04:55,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:55,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:55,844 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:55,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1244341817, now seen corresponding path program 1 times [2022-02-21 03:04:55,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:55,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297254448] [2022-02-21 03:04:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:55,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true; {15497#true} is VALID [2022-02-21 03:04:55,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {15497#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == main_~r~0#1); {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(1 == main_~r~0#1); {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 2 == main_~r~0#1; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~y~0#1 <= 2147483647; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:55,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 == main_~r~0#1); {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(1 == main_~r~0#1); {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 == main_~r~0#1; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:55,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(1 + main_~y~0#1 <= 2147483647); {15498#false} is VALID [2022-02-21 03:04:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:55,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:55,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297254448] [2022-02-21 03:04:55,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297254448] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:55,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3034568] [2022-02-21 03:04:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:55,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:55,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:04:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:55,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:55,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:56,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true; {15497#true} is VALID [2022-02-21 03:04:56,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {15497#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 == main_~r~0#1); {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(1 == main_~r~0#1); {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 2 == main_~r~0#1; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~y~0#1 <= 2147483647; {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:04:56,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 == main_~r~0#1); {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(1 == main_~r~0#1); {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 2 == main_~r~0#1; {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:56,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {15500#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(1 + main_~y~0#1 <= 2147483647); {15498#false} is VALID [2022-02-21 03:04:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:56,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:56,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(1 + main_~y~0#1 <= 2147483647); {15498#false} is VALID [2022-02-21 03:04:56,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume 2 == main_~r~0#1; {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(1 == main_~r~0#1); {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(0 == main_~r~0#1); {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume 1 + main_~i~0#1 <= 2147483647; {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~N~0#1); {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {15558#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:56,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~y~0#1 <= 2147483647; {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 2 == main_~r~0#1; {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !(1 == main_~r~0#1); {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !(0 == main_~r~0#1); {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~N~0#1); {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {15497#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {15583#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:56,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true; {15497#true} is VALID [2022-02-21 03:04:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:56,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3034568] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:56,130 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:56,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:56,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179639675] [2022-02-21 03:04:56,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:04:56,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:56,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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:04:56,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:56,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:56,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:56,157 INFO L87 Difference]: Start difference. First operand 1061 states and 1598 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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:04:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:57,002 INFO L93 Difference]: Finished difference Result 2462 states and 3872 transitions. [2022-02-21 03:04:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:57,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:04:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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:04:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-21 03:04:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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:04:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-21 03:04:57,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2022-02-21 03:04:57,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:57,270 INFO L225 Difference]: With dead ends: 2462 [2022-02-21 03:04:57,270 INFO L226 Difference]: Without dead ends: 2460 [2022-02-21 03:04:57,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:57,271 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 102 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:57,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 111 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2022-02-21 03:04:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2130. [2022-02-21 03:04:57,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:57,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2460 states. Second operand has 2130 states, 2122 states have (on average 1.5221489161168709) internal successors, (3230), 2129 states have internal predecessors, (3230), 0 states have call successors, (0), 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:04:57,688 INFO L74 IsIncluded]: Start isIncluded. First operand 2460 states. Second operand has 2130 states, 2122 states have (on average 1.5221489161168709) internal successors, (3230), 2129 states have internal predecessors, (3230), 0 states have call successors, (0), 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:04:57,689 INFO L87 Difference]: Start difference. First operand 2460 states. Second operand has 2130 states, 2122 states have (on average 1.5221489161168709) internal successors, (3230), 2129 states have internal predecessors, (3230), 0 states have call successors, (0), 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:04:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:57,938 INFO L93 Difference]: Finished difference Result 2460 states and 3676 transitions. [2022-02-21 03:04:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3676 transitions. [2022-02-21 03:04:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:57,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:57,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 2130 states, 2122 states have (on average 1.5221489161168709) internal successors, (3230), 2129 states have internal predecessors, (3230), 0 states have call successors, (0), 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 2460 states. [2022-02-21 03:04:57,946 INFO L87 Difference]: Start difference. First operand has 2130 states, 2122 states have (on average 1.5221489161168709) internal successors, (3230), 2129 states have internal predecessors, (3230), 0 states have call successors, (0), 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 2460 states. [2022-02-21 03:04:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:58,193 INFO L93 Difference]: Finished difference Result 2460 states and 3676 transitions. [2022-02-21 03:04:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3676 transitions. [2022-02-21 03:04:58,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:58,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:58,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:58,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2122 states have (on average 1.5221489161168709) internal successors, (3230), 2129 states have internal predecessors, (3230), 0 states have call successors, (0), 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:04:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3230 transitions. [2022-02-21 03:04:58,430 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3230 transitions. Word has length 19 [2022-02-21 03:04:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:58,431 INFO L470 AbstractCegarLoop]: Abstraction has 2130 states and 3230 transitions. [2022-02-21 03:04:58,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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:04:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3230 transitions. [2022-02-21 03:04:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:04:58,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:58,432 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2022-02-21 03:04:58,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:58,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:58,655 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:04:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -816359916, now seen corresponding path program 2 times [2022-02-21 03:04:58,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:58,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575608816] [2022-02-21 03:04:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:58,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {25492#true} assume { :begin_inline_ULTIMATE.init } true; {25492#true} is VALID [2022-02-21 03:04:58,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {25492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25495#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:04:58,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {25495#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(1 + main_~i~0#1 <= 2147483647); {25493#false} is VALID [2022-02-21 03:04:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-21 03:04:58,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:58,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575608816] [2022-02-21 03:04:58,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575608816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:58,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674593761] [2022-02-21 03:04:58,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:58,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:58,726 INFO L229 MonitoredProcess]: Starting monitored process 6 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:04:58,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:04:58,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:04:58,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:58,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:58,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:58,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {25492#true} assume { :begin_inline_ULTIMATE.init } true; {25492#true} is VALID [2022-02-21 03:04:58,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {25492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 <= 2147483647; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} is VALID [2022-02-21 03:04:58,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {25494#(<= |ULTIMATE.start_main_~N~0#1| 10)} assume !!(main_~i~0#1 < main_~N~0#1); {25495#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:04:58,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {25495#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(1 + main_~i~0#1 <= 2147483647); {25493#false} is VALID [2022-02-21 03:04:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-21 03:04:58,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:58,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {25556#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {25493#false} is VALID [2022-02-21 03:04:58,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~N~0#1); {25556#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:58,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~N~0#1); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~N~0#1); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~N~0#1); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~r~0#1 >= 0 && main_~r~0#1 <= 3); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~N~0#1); {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {25492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {25560#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:58,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {25492#true} assume { :begin_inline_ULTIMATE.init } true; {25492#true} is VALID [2022-02-21 03:04:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-21 03:04:58,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674593761] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:58,999 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:58,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:59,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902977788] [2022-02-21 03:04:59,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:59,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) Word has length 20 [2022-02-21 03:04:59,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:59,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:59,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:59,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:59,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:59,013 INFO L87 Difference]: Start difference. First operand 2130 states and 3230 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:59,791 INFO L93 Difference]: Finished difference Result 2130 states and 3230 transitions. [2022-02-21 03:04:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:59,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) Word has length 20 [2022-02-21 03:04:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-21 03:04:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:04:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-21 03:04:59,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-21 03:04:59,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:59,953 INFO L225 Difference]: With dead ends: 2130 [2022-02-21 03:04:59,954 INFO L226 Difference]: Without dead ends: 2129 [2022-02-21 03:04:59,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:59,955 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:59,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2022-02-21 03:05:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1799. [2022-02-21 03:05:00,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:00,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2129 states. Second operand has 1799 states, 1792 states have (on average 1.4871651785714286) internal successors, (2665), 1798 states have internal predecessors, (2665), 0 states have call successors, (0), 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:05:00,409 INFO L74 IsIncluded]: Start isIncluded. First operand 2129 states. Second operand has 1799 states, 1792 states have (on average 1.4871651785714286) internal successors, (2665), 1798 states have internal predecessors, (2665), 0 states have call successors, (0), 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:05:00,411 INFO L87 Difference]: Start difference. First operand 2129 states. Second operand has 1799 states, 1792 states have (on average 1.4871651785714286) internal successors, (2665), 1798 states have internal predecessors, (2665), 0 states have call successors, (0), 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:05:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:00,591 INFO L93 Difference]: Finished difference Result 2129 states and 3100 transitions. [2022-02-21 03:05:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3100 transitions. [2022-02-21 03:05:00,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:00,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:00,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 1799 states, 1792 states have (on average 1.4871651785714286) internal successors, (2665), 1798 states have internal predecessors, (2665), 0 states have call successors, (0), 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 2129 states. [2022-02-21 03:05:00,598 INFO L87 Difference]: Start difference. First operand has 1799 states, 1792 states have (on average 1.4871651785714286) internal successors, (2665), 1798 states have internal predecessors, (2665), 0 states have call successors, (0), 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 2129 states. [2022-02-21 03:05:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:00,757 INFO L93 Difference]: Finished difference Result 2129 states and 3100 transitions. [2022-02-21 03:05:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3100 transitions. [2022-02-21 03:05:00,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:00,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:00,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:00,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1792 states have (on average 1.4871651785714286) internal successors, (2665), 1798 states have internal predecessors, (2665), 0 states have call successors, (0), 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:05:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2665 transitions. [2022-02-21 03:05:00,859 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2665 transitions. Word has length 20 [2022-02-21 03:05:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:00,859 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2665 transitions. [2022-02-21 03:05:00,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:05:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2665 transitions. [2022-02-21 03:05:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:05:00,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:00,860 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:00,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:01,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-21 03:05:01,061 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:05:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash -333612156, now seen corresponding path program 1 times [2022-02-21 03:05:01,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:01,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823248637] [2022-02-21 03:05:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:01,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#true} assume { :begin_inline_ULTIMATE.init } true; {34110#true} is VALID [2022-02-21 03:05:01,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {34110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(0 == main_~r~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(1 == main_~r~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(2 == main_~r~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 3 == main_~r~0#1; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 <= 2147483647; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(0 == main_~r~0#1); {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(1 == main_~r~0#1); {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 2 == main_~r~0#1; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~y~0#1 <= 2147483647; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(1 + main_~y~0#1 >= -2147483648); {34111#false} is VALID [2022-02-21 03:05:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:01,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:01,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823248637] [2022-02-21 03:05:01,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823248637] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:01,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563578541] [2022-02-21 03:05:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:01,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:01,102 INFO L229 MonitoredProcess]: Starting monitored process 7 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:05:01,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:05:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:01,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:05:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:01,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:01,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#true} assume { :begin_inline_ULTIMATE.init } true; {34110#true} is VALID [2022-02-21 03:05:01,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {34110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(0 == main_~r~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(1 == main_~r~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(2 == main_~r~0#1); {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 3 == main_~r~0#1; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 <= 2147483647; {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:01,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {34112#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(0 == main_~r~0#1); {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(1 == main_~r~0#1); {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 2 == main_~r~0#1; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~y~0#1 <= 2147483647; {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:01,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {34113#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(1 + main_~y~0#1 >= -2147483648); {34111#false} is VALID [2022-02-21 03:05:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:01,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:01,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume !(1 + main_~y~0#1 >= -2147483648); {34111#false} is VALID [2022-02-21 03:05:01,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~y~0#1 <= 2147483647; {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume 2 == main_~r~0#1; {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume !(1 == main_~r~0#1); {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume !(0 == main_~r~0#1); {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {34177#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:01,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~y~0#1 - 1 <= 2147483647; {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume 3 == main_~r~0#1; {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(2 == main_~r~0#1); {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(1 == main_~r~0#1); {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(0 == main_~r~0#1); {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume 1 + main_~i~0#1 <= 2147483647; {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !!(main_~i~0#1 < main_~N~0#1); {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {34110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {34205#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:01,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#true} assume { :begin_inline_ULTIMATE.init } true; {34110#true} is VALID [2022-02-21 03:05:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:01,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563578541] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:01,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:01,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:05:01,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620504825] [2022-02-21 03:05:01,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:01,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 03:05:01,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:01,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:01,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:01,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:05:01,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:05:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:05:01,408 INFO L87 Difference]: Start difference. First operand 1799 states and 2665 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,492 INFO L93 Difference]: Finished difference Result 3111 states and 4689 transitions. [2022-02-21 03:05:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:05:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 03:05:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-02-21 03:05:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-02-21 03:05:02,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-02-21 03:05:02,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:02,857 INFO L225 Difference]: With dead ends: 3111 [2022-02-21 03:05:02,857 INFO L226 Difference]: Without dead ends: 3109 [2022-02-21 03:05:02,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:05:02,859 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:02,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 65 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-02-21 03:05:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2296. [2022-02-21 03:05:03,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:03,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3109 states. Second operand has 2296 states, 2290 states have (on average 1.459825327510917) internal successors, (3343), 2295 states have internal predecessors, (3343), 0 states have call successors, (0), 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:05:03,446 INFO L74 IsIncluded]: Start isIncluded. First operand 3109 states. Second operand has 2296 states, 2290 states have (on average 1.459825327510917) internal successors, (3343), 2295 states have internal predecessors, (3343), 0 states have call successors, (0), 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:05:03,448 INFO L87 Difference]: Start difference. First operand 3109 states. Second operand has 2296 states, 2290 states have (on average 1.459825327510917) internal successors, (3343), 2295 states have internal predecessors, (3343), 0 states have call successors, (0), 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:05:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:03,780 INFO L93 Difference]: Finished difference Result 3109 states and 4481 transitions. [2022-02-21 03:05:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4481 transitions. [2022-02-21 03:05:03,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:03,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:03,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 2296 states, 2290 states have (on average 1.459825327510917) internal successors, (3343), 2295 states have internal predecessors, (3343), 0 states have call successors, (0), 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 3109 states. [2022-02-21 03:05:03,790 INFO L87 Difference]: Start difference. First operand has 2296 states, 2290 states have (on average 1.459825327510917) internal successors, (3343), 2295 states have internal predecessors, (3343), 0 states have call successors, (0), 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 3109 states. [2022-02-21 03:05:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:04,146 INFO L93 Difference]: Finished difference Result 3109 states and 4481 transitions. [2022-02-21 03:05:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4481 transitions. [2022-02-21 03:05:04,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:04,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:04,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:04,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2290 states have (on average 1.459825327510917) internal successors, (3343), 2295 states have internal predecessors, (3343), 0 states have call successors, (0), 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:05:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3343 transitions. [2022-02-21 03:05:04,307 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3343 transitions. Word has length 21 [2022-02-21 03:05:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:04,307 INFO L470 AbstractCegarLoop]: Abstraction has 2296 states and 3343 transitions. [2022-02-21 03:05:04,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3343 transitions. [2022-02-21 03:05:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:05:04,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:04,308 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2022-02-21 03:05:04,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:04,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:04,509 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:05:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1881216384, now seen corresponding path program 1 times [2022-02-21 03:05:04,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:04,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263945588] [2022-02-21 03:05:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:04,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:04,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {46253#true} assume { :begin_inline_ULTIMATE.init } true; {46253#true} is VALID [2022-02-21 03:05:04,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {46253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !(0 == main_~r~0#1); {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 == main_~r~0#1; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !(0 == main_~r~0#1); {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 == main_~r~0#1; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~x~0#1 - 1 <= 2147483647; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume !(0 == main_~r~0#1); {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume 1 == main_~r~0#1; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - 1 >= -2147483648); {46254#false} is VALID [2022-02-21 03:05:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:04,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:04,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263945588] [2022-02-21 03:05:04,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263945588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:04,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054657324] [2022-02-21 03:05:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:04,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:04,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:04,563 INFO L229 MonitoredProcess]: Starting monitored process 8 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:05:04,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:05:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:04,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:05:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:04,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:04,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {46253#true} assume { :begin_inline_ULTIMATE.init } true; {46253#true} is VALID [2022-02-21 03:05:04,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {46253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !(0 == main_~r~0#1); {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume 1 == main_~r~0#1; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:04,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {46255#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !(0 == main_~r~0#1); {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume 1 == main_~r~0#1; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~x~0#1 - 1 <= 2147483647; {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:05:04,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {46256#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume !(0 == main_~r~0#1); {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume 1 == main_~r~0#1; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {46257#(<= 0 (+ 2 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - 1 >= -2147483648); {46254#false} is VALID [2022-02-21 03:05:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:04,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:04,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - 1 >= -2147483648); {46254#false} is VALID [2022-02-21 03:05:04,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume 1 == main_~r~0#1; {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume !(0 == main_~r~0#1); {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {46336#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume main_~x~0#1 - 1 <= 2147483647; {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume 1 == main_~r~0#1; {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume !(0 == main_~r~0#1); {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume 1 + main_~i~0#1 <= 2147483647; {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} assume !!(main_~i~0#1 < main_~N~0#1); {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - 1; {46361#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:05:04,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - 1 <= 2147483647; {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume 1 == main_~r~0#1; {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume !(0 == main_~r~0#1); {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {46253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {46386#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:04,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {46253#true} assume { :begin_inline_ULTIMATE.init } true; {46253#true} is VALID [2022-02-21 03:05:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:04,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054657324] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:04,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:04,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:05:04,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979252165] [2022-02-21 03:05:04,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:04,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 03:05:04,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:04,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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:05:04,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:04,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:05:04,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:04,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:05:04,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:04,885 INFO L87 Difference]: Start difference. First operand 2296 states and 3343 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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:05:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:07,963 INFO L93 Difference]: Finished difference Result 6601 states and 9698 transitions. [2022-02-21 03:05:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:05:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 03:05:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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:05:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:05:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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:05:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:05:07,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2022-02-21 03:05:08,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:09,452 INFO L225 Difference]: With dead ends: 6601 [2022-02-21 03:05:09,452 INFO L226 Difference]: Without dead ends: 6600 [2022-02-21 03:05:09,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:09,455 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 196 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:09,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 145 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6600 states. [2022-02-21 03:05:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6600 to 5401. [2022-02-21 03:05:10,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:10,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6600 states. Second operand has 5401 states, 5395 states have (on average 1.4556070435588508) internal successors, (7853), 5400 states have internal predecessors, (7853), 0 states have call successors, (0), 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:05:10,940 INFO L74 IsIncluded]: Start isIncluded. First operand 6600 states. Second operand has 5401 states, 5395 states have (on average 1.4556070435588508) internal successors, (7853), 5400 states have internal predecessors, (7853), 0 states have call successors, (0), 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:05:10,947 INFO L87 Difference]: Start difference. First operand 6600 states. Second operand has 5401 states, 5395 states have (on average 1.4556070435588508) internal successors, (7853), 5400 states have internal predecessors, (7853), 0 states have call successors, (0), 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:05:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:12,296 INFO L93 Difference]: Finished difference Result 6600 states and 9477 transitions. [2022-02-21 03:05:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 9477 transitions. [2022-02-21 03:05:12,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:12,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:12,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 5401 states, 5395 states have (on average 1.4556070435588508) internal successors, (7853), 5400 states have internal predecessors, (7853), 0 states have call successors, (0), 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 6600 states. [2022-02-21 03:05:12,312 INFO L87 Difference]: Start difference. First operand has 5401 states, 5395 states have (on average 1.4556070435588508) internal successors, (7853), 5400 states have internal predecessors, (7853), 0 states have call successors, (0), 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 6600 states. [2022-02-21 03:05:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:13,624 INFO L93 Difference]: Finished difference Result 6600 states and 9477 transitions. [2022-02-21 03:05:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 9477 transitions. [2022-02-21 03:05:13,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:13,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:13,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:13,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5395 states have (on average 1.4556070435588508) internal successors, (7853), 5400 states have internal predecessors, (7853), 0 states have call successors, (0), 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:05:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7853 transitions. [2022-02-21 03:05:14,429 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7853 transitions. Word has length 26 [2022-02-21 03:05:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:14,429 INFO L470 AbstractCegarLoop]: Abstraction has 5401 states and 7853 transitions. [2022-02-21 03:05:14,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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:05:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7853 transitions. [2022-02-21 03:05:14,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:05:14,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:14,431 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2022-02-21 03:05:14,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:14,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:14,632 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:05:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -205460357, now seen corresponding path program 1 times [2022-02-21 03:05:14,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:14,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121789192] [2022-02-21 03:05:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:14,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {72486#true} assume { :begin_inline_ULTIMATE.init } true; {72486#true} is VALID [2022-02-21 03:05:14,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {72486#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(0 == main_~r~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(1 == main_~r~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(2 == main_~r~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 3 == main_~r~0#1; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 <= 2147483647; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(0 == main_~r~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(1 == main_~r~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(2 == main_~r~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 3 == main_~r~0#1; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~y~0#1 - 1 <= 2147483647; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(0 == main_~r~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(1 == main_~r~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(2 == main_~r~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume 3 == main_~r~0#1; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~y~0#1 - 1 <= 2147483647; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~y~0#1 - 1 >= -2147483648); {72487#false} is VALID [2022-02-21 03:05:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:14,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:14,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121789192] [2022-02-21 03:05:14,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121789192] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:14,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187089858] [2022-02-21 03:05:14,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:14,695 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:14,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:05:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:14,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:05:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:14,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:14,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {72486#true} assume { :begin_inline_ULTIMATE.init } true; {72486#true} is VALID [2022-02-21 03:05:14,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {72486#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(0 == main_~r~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(1 == main_~r~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !(2 == main_~r~0#1); {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 3 == main_~r~0#1; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 <= 2147483647; {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:14,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {72488#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 <= 2147483647; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(0 == main_~r~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(1 == main_~r~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume !(2 == main_~r~0#1); {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume 3 == main_~r~0#1; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~y~0#1 - 1 <= 2147483647; {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:05:14,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {72489#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1))} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(0 == main_~r~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(1 == main_~r~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(2 == main_~r~0#1); {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume 3 == main_~r~0#1; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~y~0#1 - 1 <= 2147483647; {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:14,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {72490#(<= 0 (+ 2 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~y~0#1 - 1 >= -2147483648); {72487#false} is VALID [2022-02-21 03:05:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:14,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:15,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~y~0#1 - 1 >= -2147483648); {72487#false} is VALID [2022-02-21 03:05:15,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume main_~y~0#1 - 1 <= 2147483647; {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume 3 == main_~r~0#1; {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume !(2 == main_~r~0#1); {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume !(1 == main_~r~0#1); {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume !(0 == main_~r~0#1); {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {72587#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume main_~y~0#1 - 1 <= 2147483647; {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume 3 == main_~r~0#1; {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !(2 == main_~r~0#1); {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !(1 == main_~r~0#1); {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !(0 == main_~r~0#1); {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume 1 + main_~i~0#1 <= 2147483647; {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !!(main_~i~0#1 < main_~N~0#1); {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume main_~y~0#1 - 1 >= -2147483648;main_~y~0#1 := main_~y~0#1 - 1; {72618#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:15,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume main_~y~0#1 - 1 <= 2147483647; {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume 3 == main_~r~0#1; {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume !(2 == main_~r~0#1); {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume !(1 == main_~r~0#1); {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume !(0 == main_~r~0#1); {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~i~0#1 <= 2147483647; {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1); {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {72486#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {72649#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:15,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {72486#true} assume { :begin_inline_ULTIMATE.init } true; {72486#true} is VALID [2022-02-21 03:05:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:15,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187089858] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:15,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:15,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:05:15,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659329100] [2022-02-21 03:05:15,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-21 03:05:15,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:15,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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:05:15,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:15,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:05:15,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:05:15,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:15,104 INFO L87 Difference]: Start difference. First operand 5401 states and 7853 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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:05:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,297 INFO L93 Difference]: Finished difference Result 15529 states and 22802 transitions. [2022-02-21 03:05:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:05:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-21 03:05:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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:05:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:05:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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:05:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:05:26,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2022-02-21 03:05:26,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:33,671 INFO L225 Difference]: With dead ends: 15529 [2022-02-21 03:05:33,671 INFO L226 Difference]: Without dead ends: 15528 [2022-02-21 03:05:33,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:33,677 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 119 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:33,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 147 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2022-02-21 03:05:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 12718. [2022-02-21 03:05:37,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:37,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15528 states. Second operand has 12718 states, 12712 states have (on average 1.4511485210824417) internal successors, (18447), 12717 states have internal predecessors, (18447), 0 states have call successors, (0), 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:05:37,432 INFO L74 IsIncluded]: Start isIncluded. First operand 15528 states. Second operand has 12718 states, 12712 states have (on average 1.4511485210824417) internal successors, (18447), 12717 states have internal predecessors, (18447), 0 states have call successors, (0), 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:05:37,442 INFO L87 Difference]: Start difference. First operand 15528 states. Second operand has 12718 states, 12712 states have (on average 1.4511485210824417) internal successors, (18447), 12717 states have internal predecessors, (18447), 0 states have call successors, (0), 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:05:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:43,834 INFO L93 Difference]: Finished difference Result 15528 states and 22275 transitions. [2022-02-21 03:05:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 22275 transitions. [2022-02-21 03:05:43,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:43,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:43,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 12718 states, 12712 states have (on average 1.4511485210824417) internal successors, (18447), 12717 states have internal predecessors, (18447), 0 states have call successors, (0), 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 15528 states. [2022-02-21 03:05:43,870 INFO L87 Difference]: Start difference. First operand has 12718 states, 12712 states have (on average 1.4511485210824417) internal successors, (18447), 12717 states have internal predecessors, (18447), 0 states have call successors, (0), 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 15528 states. [2022-02-21 03:05:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:50,690 INFO L93 Difference]: Finished difference Result 15528 states and 22275 transitions. [2022-02-21 03:05:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 22275 transitions. [2022-02-21 03:05:50,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:50,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:50,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:50,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12718 states, 12712 states have (on average 1.4511485210824417) internal successors, (18447), 12717 states have internal predecessors, (18447), 0 states have call successors, (0), 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:05:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 18447 transitions. [2022-02-21 03:05:55,718 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 18447 transitions. Word has length 32 [2022-02-21 03:05:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:55,718 INFO L470 AbstractCegarLoop]: Abstraction has 12718 states and 18447 transitions. [2022-02-21 03:05:55,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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:05:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 18447 transitions. [2022-02-21 03:05:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 03:05:55,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:55,720 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2022-02-21 03:05:55,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 03:05:55,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:05:55,922 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:05:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1919460695, now seen corresponding path program 2 times [2022-02-21 03:05:55,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:55,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663463222] [2022-02-21 03:05:55,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:55,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {134062#true} assume { :begin_inline_ULTIMATE.init } true; {134062#true} is VALID [2022-02-21 03:05:55,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {134062#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 0 == main_~r~0#1; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 <= 2147483647; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:55,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 == main_~r~0#1; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:55,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~i~0#1 < main_~N~0#1); {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~i~0#1 <= 2147483647; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 == main_~r~0#1; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:55,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~i~0#1 < main_~N~0#1); {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~i~0#1 <= 2147483647; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 == main_~r~0#1; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:55,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:55,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~i~0#1 < main_~N~0#1); {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:55,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~i~0#1 <= 2147483647; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 == main_~r~0#1; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(1 + main_~x~0#1 <= 2147483647); {134063#false} is VALID [2022-02-21 03:05:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:56,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:56,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663463222] [2022-02-21 03:05:56,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663463222] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:56,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344457739] [2022-02-21 03:05:56,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:05:56,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:56,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:56,003 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05:56,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:05:56,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:05:56,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:05:56,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:05:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:56,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:56,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {134062#true} assume { :begin_inline_ULTIMATE.init } true; {134062#true} is VALID [2022-02-21 03:05:56,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {134062#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1); {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 0 == main_~r~0#1; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 <= 2147483647; {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:05:56,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {134064#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1); {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 == main_~r~0#1; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:56,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {134065#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~i~0#1 < main_~N~0#1); {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~i~0#1 <= 2147483647; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 == main_~r~0#1; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:56,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {134066#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~i~0#1 < main_~N~0#1); {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~i~0#1 <= 2147483647; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 == main_~r~0#1; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:56,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {134067#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~i~0#1 < main_~N~0#1); {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~i~0#1 <= 2147483647; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 == main_~r~0#1; {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:56,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {134068#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(1 + main_~x~0#1 <= 2147483647); {134063#false} is VALID [2022-02-21 03:05:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:56,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:56,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {134063#false} is VALID [2022-02-21 03:05:56,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 == main_~r~0#1; {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:56,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:56,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:56,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~i~0#1 <= 2147483647; {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:56,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~N~0#1); {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:56,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134177#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:56,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 == main_~r~0#1; {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~N~0#1); {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134196#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:56,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 <= 2147483647; {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 0 == main_~r~0#1; {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~i~0#1 <= 2147483647; {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume !!(main_~i~0#1 < main_~N~0#1); {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134218#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:56,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~x~0#1 <= 2147483647; {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 0 == main_~r~0#1; {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~i~0#1 <= 2147483647; {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume !!(main_~i~0#1 < main_~N~0#1); {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {134240#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:56,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~x~0#1 <= 2147483647; {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 0 == main_~r~0#1; {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume main_~r~0#1 >= 0 && main_~r~0#1 <= 3; {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~r~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~i~0#1 <= 2147483647; {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume !!(main_~i~0#1 < main_~N~0#1); {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {134062#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1, main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~0#1;havoc main_~N~0#1;main_~N~0#1 := 10;main_~x~0#1 := 0;main_~y~0#1 := 0;main_~i~0#1 := 0; {134262#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:56,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {134062#true} assume { :begin_inline_ULTIMATE.init } true; {134062#true} is VALID [2022-02-21 03:05:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:56,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344457739] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:56,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:56,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:05:56,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40231103] [2022-02-21 03:05:56,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-21 03:05:56,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:56,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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:05:56,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:56,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:05:56,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:05:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:05:56,429 INFO L87 Difference]: Start difference. First operand 12718 states and 18447 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)