./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-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/AliasDarteFeautrierGonnord-SAS2010-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 1978406b317087fc6936fcfda9d4ee773e4c87c61c4595e0ff4751e61b0b216a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:46,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:46,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:46,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:46,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:46,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:46,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:46,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:46,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:46,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:46,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:46,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:46,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:46,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:46,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:46,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:46,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:46,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:46,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:46,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:46,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:46,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:46,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:46,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:46,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:46,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:46,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:46,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:46,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:46,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:46,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:46,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:46,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:46,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:46,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:46,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:46,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:46,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:46,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:46,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:46,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:46,856 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:03:46,875 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:46,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:46,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:46,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:46,876 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:46,876 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:46,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:46,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:46,877 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:46,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:46,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:46,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:46,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:46,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:46,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:46,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:46,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:46,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:46,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:46,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:46,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:46,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:46,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:46,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:46,881 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 -> 1978406b317087fc6936fcfda9d4ee773e4c87c61c4595e0ff4751e61b0b216a [2022-02-21 03:03:47,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:47,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:47,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:47,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:47,073 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:47,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d.c [2022-02-21 03:03:47,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a086386f/b106562f18ad40b9993298f20c3389f4/FLAGa33aaba72 [2022-02-21 03:03:47,465 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:47,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d.c [2022-02-21 03:03:47,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a086386f/b106562f18ad40b9993298f20c3389f4/FLAGa33aaba72 [2022-02-21 03:03:47,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a086386f/b106562f18ad40b9993298f20c3389f4 [2022-02-21 03:03:47,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:47,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:47,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:47,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:47,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:47,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b1139b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47, skipping insertion in model container [2022-02-21 03:03:47,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:47,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:47,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:47,655 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:47,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:47,679 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:47,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47 WrapperNode [2022-02-21 03:03:47,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:47,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:47,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:47,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:47,686 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:03:47" (1/1) ... [2022-02-21 03:03:47,689 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:03:47" (1/1) ... [2022-02-21 03:03:47,706 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2022-02-21 03:03:47,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:47,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:47,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:47,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:47,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:47,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:47,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:47,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:47,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (1/1) ... [2022-02-21 03:03:47,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:47,753 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:03:47,759 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:03:47,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:47,819 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:47,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:47,947 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:47,952 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:47,953 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:03:47,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:47 BoogieIcfgContainer [2022-02-21 03:03:47,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:47,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:47,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:47,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:47,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:47" (1/3) ... [2022-02-21 03:03:47,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7287b2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:47, skipping insertion in model container [2022-02-21 03:03:47,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:47" (2/3) ... [2022-02-21 03:03:47,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7287b2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:47, skipping insertion in model container [2022-02-21 03:03:47,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:47" (3/3) ... [2022-02-21 03:03:47,965 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-random2d.c [2022-02-21 03:03:47,975 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:47,975 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:03:48,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:48,023 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:03:48,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:03:48,034 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:03:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:03:48,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:03:48,038 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:03:48,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:03:48,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277822852] [2022-02-21 03:03:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true; {35#true} is VALID [2022-02-21 03:03:48,199 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:48,200 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:03:48,201 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:03:48,202 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:03:48,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277822852] [2022-02-21 03:03:48,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277822852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:48,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:48,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:48,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700130403] [2022-02-21 03:03:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,211 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:03:48,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,214 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:03:48,234 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:03:48,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:48,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:48,255 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:03:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,347 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-02-21 03:03:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:48,348 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:03:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:48,350 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:03:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-21 03:03:48,357 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:03:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-21 03:03:48,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-02-21 03:03:48,419 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:03:48,430 INFO L225 Difference]: With dead ends: 44 [2022-02-21 03:03:48,430 INFO L226 Difference]: Without dead ends: 31 [2022-02-21 03:03:48,432 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:03:48,436 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:03:48,437 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:03:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-21 03:03:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-21 03:03:48,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,460 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:03:48,461 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:03:48,461 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:03:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,465 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:03:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:03:48,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,466 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:03:48,467 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:03:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,469 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:03:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:03:48,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,471 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:03:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-02-21 03:03:48,475 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 4 [2022-02-21 03:03:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,476 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-02-21 03:03:48,477 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:03:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:03:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:48,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:48,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:48,478 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:03:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:03:48,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612403222] [2022-02-21 03:03:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true; {183#true} is VALID [2022-02-21 03:03:48,520 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:48,520 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:03:48,521 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:03:48,521 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:03:48,521 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:03:48,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612403222] [2022-02-21 03:03:48,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612403222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:48,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:48,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:48,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744675309] [2022-02-21 03:03:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,526 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:03:48,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,527 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:03:48,531 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:03:48,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:48,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:48,538 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:03:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,572 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 03:03:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:48,573 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:03:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:48,574 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:03:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:03:48,575 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:03:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:03:48,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-21 03:03:48,604 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:03:48,607 INFO L225 Difference]: With dead ends: 30 [2022-02-21 03:03:48,607 INFO L226 Difference]: Without dead ends: 29 [2022-02-21 03:03:48,607 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:03:48,612 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:03:48,613 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:03:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-21 03:03:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-21 03:03:48,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,620 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:03:48,621 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:03:48,621 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:03:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,624 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:03:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:03:48,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,625 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:03:48,625 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:03:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,626 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:03:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:03:48,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,627 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:03:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-21 03:03:48,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 5 [2022-02-21 03:03:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,629 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:03:48,629 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:03:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:03:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:03:48,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:48,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:48,630 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:03:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash 294944169, now seen corresponding path program 1 times [2022-02-21 03:03:48,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017378834] [2022-02-21 03:03:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} assume { :begin_inline_ULTIMATE.init } true; {309#true} is VALID [2022-02-21 03:03:48,653 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:48,654 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:03:48,654 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:03:48,655 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:03:48,655 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:03:48,656 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:03:48,656 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:03:48,656 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:03:48,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017378834] [2022-02-21 03:03:48,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017378834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:48,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:48,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:48,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239511213] [2022-02-21 03:03:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,658 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:03:48,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,658 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:03:48,664 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:03:48,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:48,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:48,665 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:03:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,721 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-02-21 03:03:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:48,721 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:03:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:48,722 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:03:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:48,723 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:03:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:48,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:03:48,766 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:03:48,771 INFO L225 Difference]: With dead ends: 52 [2022-02-21 03:03:48,771 INFO L226 Difference]: Without dead ends: 50 [2022-02-21 03:03:48,772 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:03:48,777 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:03:48,778 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:03:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-21 03:03:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-02-21 03:03:48,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,788 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:03:48,788 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:03:48,788 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:03:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,790 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-21 03:03:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-21 03:03:48,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,790 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:03:48,790 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:03:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,792 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-21 03:03:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-21 03:03:48,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,793 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:03:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-21 03:03:48,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 8 [2022-02-21 03:03:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,794 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-21 03:03:48,794 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:03:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-21 03:03:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:03:48,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,794 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:48,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:48,795 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:03:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash 294981328, now seen corresponding path program 1 times [2022-02-21 03:03:48,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463337907] [2022-02-21 03:03:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {516#true} assume { :begin_inline_ULTIMATE.init } true; {516#true} is VALID [2022-02-21 03:03:48,826 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:48,826 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:03:48,827 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:03:48,827 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:03:48,828 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:03:48,828 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:03:48,829 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:03:48,829 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:03:48,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463337907] [2022-02-21 03:03:48,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463337907] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:48,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931232551] [2022-02-21 03:03:48,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:48,833 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:03:48,834 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:03:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:49,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {516#true} assume { :begin_inline_ULTIMATE.init } true; {516#true} is VALID [2022-02-21 03:03:49,011 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:49,011 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:03:49,014 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:03:49,015 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:03:49,015 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:03:49,016 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:03:49,016 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:03:49,016 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:03:49,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:49,062 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:03:49,062 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:03:49,063 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:03:49,063 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:03:49,063 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:03:49,064 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:03:49,064 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:49,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {516#true} assume { :begin_inline_ULTIMATE.init } true; {516#true} is VALID [2022-02-21 03:03:49,064 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:03:49,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931232551] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:49,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:49,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:49,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73746549] [2022-02-21 03:03:49,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:49,065 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:03:49,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:49,066 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:03:49,074 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:03:49,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:49,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:49,075 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:03:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,220 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2022-02-21 03:03:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:49,220 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:03:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:49,220 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:03:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-02-21 03:03:49,222 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:03:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-02-21 03:03:49,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 122 transitions. [2022-02-21 03:03:49,316 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:03:49,319 INFO L225 Difference]: With dead ends: 147 [2022-02-21 03:03:49,319 INFO L226 Difference]: Without dead ends: 146 [2022-02-21 03:03:49,319 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:03:49,320 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:03:49,320 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:03:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-21 03:03:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2022-02-21 03:03:49,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:49,338 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:03:49,339 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:03:49,339 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:03:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,344 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-02-21 03:03:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2022-02-21 03:03:49,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,349 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:03:49,349 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:03:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,354 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-02-21 03:03:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2022-02-21 03:03:49,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:49,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:49,356 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:03:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 197 transitions. [2022-02-21 03:03:49,360 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 197 transitions. Word has length 8 [2022-02-21 03:03:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:49,360 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 197 transitions. [2022-02-21 03:03:49,360 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:03:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 197 transitions. [2022-02-21 03:03:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:03:49,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:49,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:49,379 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:03:49,574 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:03:49,574 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:03:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 553334702, now seen corresponding path program 1 times [2022-02-21 03:03:49,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:49,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289587304] [2022-02-21 03:03:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1147#true} assume { :begin_inline_ULTIMATE.init } true; {1147#true} is VALID [2022-02-21 03:03:49,601 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:49,601 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:03:49,601 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:03:49,602 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:03:49,602 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:03:49,602 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:03:49,603 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:03:49,603 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:03:49,603 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:03:49,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:49,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289587304] [2022-02-21 03:03:49,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289587304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:49,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:49,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:49,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251772412] [2022-02-21 03:03:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:49,605 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:03:49,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:49,605 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:03:49,610 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:03:49,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:49,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:49,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:49,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:49,611 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:03:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,670 INFO L93 Difference]: Finished difference Result 213 states and 338 transitions. [2022-02-21 03:03:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:49,671 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:03:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:49,671 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:03:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:49,672 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:03:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:49,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:03:49,710 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:03:49,713 INFO L225 Difference]: With dead ends: 213 [2022-02-21 03:03:49,713 INFO L226 Difference]: Without dead ends: 211 [2022-02-21 03:03:49,714 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:03:49,714 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:03:49,715 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:03:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-21 03:03:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2022-02-21 03:03:49,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:49,754 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:03:49,755 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:03:49,755 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:03:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,760 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2022-02-21 03:03:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 327 transitions. [2022-02-21 03:03:49,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,762 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:03:49,762 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:03:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,767 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2022-02-21 03:03:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 327 transitions. [2022-02-21 03:03:49,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:49,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:49,768 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:03:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 327 transitions. [2022-02-21 03:03:49,774 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 327 transitions. Word has length 9 [2022-02-21 03:03:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:49,774 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 327 transitions. [2022-02-21 03:03:49,774 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:03:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 327 transitions. [2022-02-21 03:03:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:03:49,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:49,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:49,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:03:49,775 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:03:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -26301678, now seen corresponding path program 1 times [2022-02-21 03:03:49,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:49,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933731846] [2022-02-21 03:03:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {2025#true} assume { :begin_inline_ULTIMATE.init } true; {2025#true} is VALID [2022-02-21 03:03:49,811 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:49,812 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:03:49,812 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:03:49,812 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:03:49,813 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:03:49,813 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:03:49,814 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:03:49,814 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:03:49,814 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:03:49,814 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:03:49,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:49,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933731846] [2022-02-21 03:03:49,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933731846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:49,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:49,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:49,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041522820] [2022-02-21 03:03:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:49,816 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:03:49,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:49,816 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:03:49,822 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:03:49,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:49,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:49,823 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:03:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,920 INFO L93 Difference]: Finished difference Result 346 states and 547 transitions. [2022-02-21 03:03:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:49,920 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:03:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:49,920 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:03:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:49,921 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:03:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:49,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:03:49,953 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:03:49,968 INFO L225 Difference]: With dead ends: 346 [2022-02-21 03:03:49,968 INFO L226 Difference]: Without dead ends: 344 [2022-02-21 03:03:49,968 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:03:49,968 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:03:49,969 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:03:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-02-21 03:03:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2022-02-21 03:03:50,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:50,015 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:03:50,015 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:03:50,016 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:03:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,026 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2022-02-21 03:03:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 523 transitions. [2022-02-21 03:03:50,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:50,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:50,027 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:03:50,028 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:03:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,037 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2022-02-21 03:03:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 523 transitions. [2022-02-21 03:03:50,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:50,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:50,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:50,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:50,038 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:03:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2022-02-21 03:03:50,045 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 10 [2022-02-21 03:03:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:50,046 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2022-02-21 03:03:50,046 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:03:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2022-02-21 03:03:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:03:50,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:50,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:50,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:03:50,046 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:03:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -815351945, now seen corresponding path program 1 times [2022-02-21 03:03:50,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:50,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192237222] [2022-02-21 03:03:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {3451#true} assume { :begin_inline_ULTIMATE.init } true; {3451#true} is VALID [2022-02-21 03:03:50,066 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:50,066 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:03:50,067 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:03:50,067 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:03:50,067 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:03:50,068 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:03:50,068 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:03:50,068 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:03:50,068 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:03:50,069 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:03:50,069 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:03:50,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:50,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192237222] [2022-02-21 03:03:50,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192237222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:50,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:50,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:50,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137459727] [2022-02-21 03:03:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:50,070 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:03:50,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:50,070 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:03:50,076 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:03:50,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:50,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:50,077 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:03:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,205 INFO L93 Difference]: Finished difference Result 550 states and 841 transitions. [2022-02-21 03:03:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:50,205 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:03:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:50,206 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:03:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:50,206 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:03:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 03:03:50,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 03:03:50,238 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:03:50,249 INFO L225 Difference]: With dead ends: 550 [2022-02-21 03:03:50,249 INFO L226 Difference]: Without dead ends: 548 [2022-02-21 03:03:50,249 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:03:50,250 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:03:50,250 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:03:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-02-21 03:03:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-02-21 03:03:50,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:50,338 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:03:50,339 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:03:50,340 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:03:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,353 INFO L93 Difference]: Finished difference Result 548 states and 809 transitions. [2022-02-21 03:03:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 809 transitions. [2022-02-21 03:03:50,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:50,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:50,355 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:03:50,356 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:03:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,368 INFO L93 Difference]: Finished difference Result 548 states and 809 transitions. [2022-02-21 03:03:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 809 transitions. [2022-02-21 03:03:50,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:50,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:50,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:50,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:50,370 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:03:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 809 transitions. [2022-02-21 03:03:50,382 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 809 transitions. Word has length 11 [2022-02-21 03:03:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:50,382 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 809 transitions. [2022-02-21 03:03:50,382 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:03:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 809 transitions. [2022-02-21 03:03:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:03:50,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:50,383 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:03:50,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:03:50,383 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:03:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -329510763, now seen corresponding path program 1 times [2022-02-21 03:03:50,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:50,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854460812] [2022-02-21 03:03:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {5741#true} assume { :begin_inline_ULTIMATE.init } true; {5741#true} is VALID [2022-02-21 03:03:50,420 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:50,421 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:03:50,421 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:03:50,421 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:03:50,422 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:03:50,422 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:03:50,422 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:03:50,423 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:03:50,423 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:03:50,423 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:03:50,424 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:03:50,424 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:03:50,424 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:03:50,425 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:03:50,425 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:03:50,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:50,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854460812] [2022-02-21 03:03:50,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854460812] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:50,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156754554] [2022-02-21 03:03:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:50,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:50,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:50,427 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:03:50,431 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:03:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:50,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {5741#true} assume { :begin_inline_ULTIMATE.init } true; {5741#true} is VALID [2022-02-21 03:03:50,521 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:50,521 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:03:50,522 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:03:50,522 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:03:50,522 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:03:50,523 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:03:50,523 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:03:50,523 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:03:50,524 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:03:50,524 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:03:50,524 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:03:50,525 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:03:50,525 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:03:50,525 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:03:50,526 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:03:50,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:50,584 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:03:50,584 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:03:50,585 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:03:50,585 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:03:50,585 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:03:50,586 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:03:50,591 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:03:50,591 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:03:50,592 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:03:50,592 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:03:50,592 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:03:50,593 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:03:50,593 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:03:50,594 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:50,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {5741#true} assume { :begin_inline_ULTIMATE.init } true; {5741#true} is VALID [2022-02-21 03:03:50,594 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:03:50,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156754554] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:50,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:50,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:50,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138656415] [2022-02-21 03:03:50,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:50,594 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:03:50,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:50,595 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:03:50,610 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:03:50,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:50,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:50,611 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:03:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,941 INFO L93 Difference]: Finished difference Result 1047 states and 1608 transitions. [2022-02-21 03:03:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:50,942 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:03:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:50,942 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:03:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2022-02-21 03:03:50,943 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:03:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2022-02-21 03:03:50,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 150 transitions. [2022-02-21 03:03:51,035 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:03:51,078 INFO L225 Difference]: With dead ends: 1047 [2022-02-21 03:03:51,079 INFO L226 Difference]: Without dead ends: 1045 [2022-02-21 03:03:51,079 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:03:51,080 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:03:51,080 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:03:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-02-21 03:03:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 904. [2022-02-21 03:03:51,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:51,220 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:03:51,221 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:03:51,222 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:03:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,256 INFO L93 Difference]: Finished difference Result 1045 states and 1538 transitions. [2022-02-21 03:03:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1538 transitions. [2022-02-21 03:03:51,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:51,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:51,259 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:03:51,260 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:03:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,297 INFO L93 Difference]: Finished difference Result 1045 states and 1538 transitions. [2022-02-21 03:03:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1538 transitions. [2022-02-21 03:03:51,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:51,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:51,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:51,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:51,300 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:03:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1367 transitions. [2022-02-21 03:03:51,328 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1367 transitions. Word has length 15 [2022-02-21 03:03:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:51,329 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1367 transitions. [2022-02-21 03:03:51,329 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:03:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1367 transitions. [2022-02-21 03:03:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:03:51,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:51,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:51,349 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:03:51,537 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:03:51,538 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:03:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1722862724, now seen corresponding path program 1 times [2022-02-21 03:03:51,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:51,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950740889] [2022-02-21 03:03:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:51,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {10038#true} assume { :begin_inline_ULTIMATE.init } true; {10038#true} is VALID [2022-02-21 03:03:51,567 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:51,567 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:03:51,568 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:03:51,568 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:03:51,568 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:03:51,569 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:03:51,571 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:03:51,571 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:03:51,572 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:03:51,572 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:03:51,572 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:03:51,573 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:03:51,573 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:03:51,573 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:03:51,574 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:03:51,574 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:03:51,574 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:03:51,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:51,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950740889] [2022-02-21 03:03:51,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950740889] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:51,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106325165] [2022-02-21 03:03:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:51,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:51,576 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:03:51,577 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:03:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:51,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:51,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:51,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {10038#true} assume { :begin_inline_ULTIMATE.init } true; {10038#true} is VALID [2022-02-21 03:03:51,673 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:51,673 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:03:51,673 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:03:51,674 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:03:51,674 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:03:51,674 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:03:51,675 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:03:51,675 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:03:51,676 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:03:51,676 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:03:51,676 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:03:51,677 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:03:51,677 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:03:51,677 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:03:51,678 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:03:51,678 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:03:51,678 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:03:51,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:51,749 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:03:51,749 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:03:51,750 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:03:51,750 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:03:51,750 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:03:51,751 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:03:51,751 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:03:51,751 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:03:51,752 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:03:51,752 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:03:51,752 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:03:51,753 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:03:51,753 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:03:51,753 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:03:51,753 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:03:51,754 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:51,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {10038#true} assume { :begin_inline_ULTIMATE.init } true; {10038#true} is VALID [2022-02-21 03:03:51,754 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:03:51,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106325165] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:51,754 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:51,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:51,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839984758] [2022-02-21 03:03:51,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:51,755 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:03:51,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:51,755 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:03:51,776 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:03:51,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:51,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:51,776 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:03:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:52,159 INFO L93 Difference]: Finished difference Result 1365 states and 2106 transitions. [2022-02-21 03:03:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:03:52,159 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:03:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:52,160 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:03:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-02-21 03:03:52,160 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:03:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-02-21 03:03:52,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2022-02-21 03:03:52,213 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:03:52,267 INFO L225 Difference]: With dead ends: 1365 [2022-02-21 03:03:52,268 INFO L226 Difference]: Without dead ends: 1363 [2022-02-21 03:03:52,268 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:03:52,270 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:03:52,271 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:03:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-02-21 03:03:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1061. [2022-02-21 03:03:52,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:52,442 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:03:52,443 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:03:52,444 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:03:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:52,494 INFO L93 Difference]: Finished difference Result 1363 states and 2031 transitions. [2022-02-21 03:03:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2031 transitions. [2022-02-21 03:03:52,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:52,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:52,507 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:03:52,509 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:03:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:52,558 INFO L93 Difference]: Finished difference Result 1363 states and 2031 transitions. [2022-02-21 03:03:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2031 transitions. [2022-02-21 03:03:52,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:52,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:52,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:52,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:52,561 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:03:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1598 transitions. [2022-02-21 03:03:52,594 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1598 transitions. Word has length 17 [2022-02-21 03:03:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:52,595 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1598 transitions. [2022-02-21 03:03:52,596 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:03:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1598 transitions. [2022-02-21 03:03:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:03:52,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:52,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:03:52,615 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:03:52,812 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:03:52,813 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:03:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1244341817, now seen corresponding path program 1 times [2022-02-21 03:03:52,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:52,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764457236] [2022-02-21 03:03:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true; {15497#true} is VALID [2022-02-21 03:03:52,852 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:52,852 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:03:52,852 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:03:52,852 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:03:52,853 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:03:52,853 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:03:52,853 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:03:52,854 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:03:52,854 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:03:52,854 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:03:52,855 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:03:52,855 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:03:52,855 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:03:52,855 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:03:52,856 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:03:52,856 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:03:52,856 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:03:52,857 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:03:52,857 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:03:52,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:52,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764457236] [2022-02-21 03:03:52,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764457236] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:52,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311959566] [2022-02-21 03:03:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:52,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:52,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:52,858 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:03:52,860 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:03:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:52,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true; {15497#true} is VALID [2022-02-21 03:03:52,953 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:52,954 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:03:52,954 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:03:52,954 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:03:52,955 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:03:52,955 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:03:52,956 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:03:52,956 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:03:52,956 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:03:52,957 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:03:52,957 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:03:52,957 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:03:52,958 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:03:52,958 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:03:52,958 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:03:52,959 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:03:52,959 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:03:52,962 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:03:52,962 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:03:52,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:53,029 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:03:53,030 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:03:53,030 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:03:53,031 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:03:53,031 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:03:53,031 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:03:53,032 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:03:53,032 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:03:53,033 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:03:53,033 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:03:53,033 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:03:53,034 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:03:53,034 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:03:53,034 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:03:53,035 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:03:53,035 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:03:53,035 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:03:53,036 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:53,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true; {15497#true} is VALID [2022-02-21 03:03:53,036 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:03:53,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311959566] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:53,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:53,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:53,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891907899] [2022-02-21 03:03:53,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:53,037 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:03:53,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:53,038 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:03:53,058 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:03:53,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:53,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:53,059 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:03:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:53,718 INFO L93 Difference]: Finished difference Result 2462 states and 3872 transitions. [2022-02-21 03:03:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:53,719 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:03:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:53,719 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:03:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-21 03:03:53,720 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:03:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-21 03:03:53,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2022-02-21 03:03:53,801 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:03:53,977 INFO L225 Difference]: With dead ends: 2462 [2022-02-21 03:03:53,977 INFO L226 Difference]: Without dead ends: 2460 [2022-02-21 03:03:53,978 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:03:53,979 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:03:53,979 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:03:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2022-02-21 03:03:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2130. [2022-02-21 03:03:54,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:54,342 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:03:54,343 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:03:54,345 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:03:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,491 INFO L93 Difference]: Finished difference Result 2460 states and 3676 transitions. [2022-02-21 03:03:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3676 transitions. [2022-02-21 03:03:54,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:54,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:54,500 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:03:54,502 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:03:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,648 INFO L93 Difference]: Finished difference Result 2460 states and 3676 transitions. [2022-02-21 03:03:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3676 transitions. [2022-02-21 03:03:54,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:54,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:54,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:54,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:54,654 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:03:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3230 transitions. [2022-02-21 03:03:54,778 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3230 transitions. Word has length 19 [2022-02-21 03:03:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:54,778 INFO L470 AbstractCegarLoop]: Abstraction has 2130 states and 3230 transitions. [2022-02-21 03:03:54,778 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:03:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3230 transitions. [2022-02-21 03:03:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:03:54,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:54,779 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2022-02-21 03:03:54,794 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:03:54,979 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:03:54,979 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:03:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash -816359916, now seen corresponding path program 2 times [2022-02-21 03:03:54,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:54,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039281970] [2022-02-21 03:03:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {25492#true} assume { :begin_inline_ULTIMATE.init } true; {25492#true} is VALID [2022-02-21 03:03:55,025 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:55,025 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:03:55,026 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:03:55,026 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:03:55,026 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:03:55,027 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:03:55,027 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:03:55,027 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:03:55,028 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:03:55,028 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:03:55,028 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:03:55,028 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:03:55,029 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:03:55,029 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:03:55,029 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:03:55,030 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:03:55,030 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:03:55,030 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:03:55,035 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:03:55,036 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:03:55,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:55,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039281970] [2022-02-21 03:03:55,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039281970] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:55,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638769057] [2022-02-21 03:03:55,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:55,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:55,038 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:03:55,039 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:03:55,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:03:55,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:55,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:55,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {25492#true} assume { :begin_inline_ULTIMATE.init } true; {25492#true} is VALID [2022-02-21 03:03:55,142 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:55,142 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:03:55,143 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:03:55,143 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:03:55,143 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:03:55,144 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:03:55,144 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:03:55,144 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:03:55,145 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:03:55,145 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:03:55,145 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:03:55,146 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:03:55,146 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:03:55,146 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:03:55,147 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:03:55,147 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:03:55,147 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:03:55,148 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:03:55,148 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:03:55,149 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:03:55,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:55,233 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:03:55,233 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:03:55,234 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:03:55,234 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:03:55,234 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:03:55,235 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:03:55,235 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:03:55,235 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:03:55,236 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:03:55,236 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:03:55,237 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:03:55,237 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:03:55,237 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:03:55,238 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:03:55,238 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:03:55,238 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:03:55,239 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:03:55,239 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:03:55,239 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:55,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {25492#true} assume { :begin_inline_ULTIMATE.init } true; {25492#true} is VALID [2022-02-21 03:03:55,240 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:03:55,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638769057] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:55,240 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:55,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:55,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708415052] [2022-02-21 03:03:55,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:55,241 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:03:55,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,241 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:03:55,250 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:03:55,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:55,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:55,251 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:03:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:55,923 INFO L93 Difference]: Finished difference Result 2130 states and 3230 transitions. [2022-02-21 03:03:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:55,923 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:03:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:55,923 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:03:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-21 03:03:55,924 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:03:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-21 03:03:55,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-21 03:03:55,941 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:03:56,086 INFO L225 Difference]: With dead ends: 2130 [2022-02-21 03:03:56,086 INFO L226 Difference]: Without dead ends: 2129 [2022-02-21 03:03:56,088 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:03:56,088 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:03:56,089 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:03:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2022-02-21 03:03:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1799. [2022-02-21 03:03:56,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:56,463 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:03:56,464 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:03:56,465 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:03:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,576 INFO L93 Difference]: Finished difference Result 2129 states and 3100 transitions. [2022-02-21 03:03:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3100 transitions. [2022-02-21 03:03:56,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,581 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:03:56,583 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:03:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,693 INFO L93 Difference]: Finished difference Result 2129 states and 3100 transitions. [2022-02-21 03:03:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3100 transitions. [2022-02-21 03:03:56,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:56,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:56,698 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:03:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2665 transitions. [2022-02-21 03:03:56,787 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2665 transitions. Word has length 20 [2022-02-21 03:03:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:56,787 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2665 transitions. [2022-02-21 03:03:56,787 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:03:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2665 transitions. [2022-02-21 03:03:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:03:56,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:56,788 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:56,804 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:03:56,994 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:03:56,994 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:03:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -333612156, now seen corresponding path program 1 times [2022-02-21 03:03:56,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:56,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608037342] [2022-02-21 03:03:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#true} assume { :begin_inline_ULTIMATE.init } true; {34110#true} is VALID [2022-02-21 03:03:57,021 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:57,021 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:03:57,021 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:03:57,021 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:03:57,022 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:03:57,022 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:03:57,022 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:03:57,023 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:03:57,023 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:03:57,023 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:03:57,024 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:03:57,024 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:03:57,024 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:03:57,024 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:03:57,025 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:03:57,025 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:03:57,025 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:03:57,026 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:03:57,026 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:03:57,026 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:03:57,027 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:03:57,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:57,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608037342] [2022-02-21 03:03:57,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608037342] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:57,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510819003] [2022-02-21 03:03:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:57,029 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:03:57,030 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:03:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:57,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#true} assume { :begin_inline_ULTIMATE.init } true; {34110#true} is VALID [2022-02-21 03:03:57,153 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:57,154 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:03:57,154 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:03:57,155 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:03:57,155 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:03:57,155 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:03:57,156 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:03:57,156 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:03:57,156 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:03:57,156 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:03:57,157 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:03:57,157 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:03:57,157 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:03:57,158 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:03:57,158 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:03:57,158 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:03:57,158 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:03:57,159 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:03:57,159 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:03:57,159 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:03:57,160 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:03:57,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:57,259 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:03:57,260 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:03:57,260 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:03:57,261 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:03:57,261 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:03:57,261 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:03:57,262 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:03:57,262 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:03:57,263 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:03:57,263 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:03:57,263 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:03:57,264 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:03:57,264 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:03:57,264 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:03:57,264 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:03:57,265 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:03:57,265 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:03:57,265 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:03:57,266 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:03:57,266 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:03:57,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {34110#true} assume { :begin_inline_ULTIMATE.init } true; {34110#true} is VALID [2022-02-21 03:03:57,266 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:03:57,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510819003] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:57,266 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:57,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:57,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545398738] [2022-02-21 03:03:57,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:57,267 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:03:57,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:57,267 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:03:57,291 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:03:57,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:57,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:57,292 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:03:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,284 INFO L93 Difference]: Finished difference Result 3111 states and 4689 transitions. [2022-02-21 03:03:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:03:58,284 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:03:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:58,284 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:03:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-02-21 03:03:58,285 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:03:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-02-21 03:03:58,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-02-21 03:03:58,341 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:03:58,663 INFO L225 Difference]: With dead ends: 3111 [2022-02-21 03:03:58,664 INFO L226 Difference]: Without dead ends: 3109 [2022-02-21 03:03:58,665 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:03:58,665 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:03:58,666 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:03:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-02-21 03:03:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2296. [2022-02-21 03:03:59,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:59,193 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:03:59,194 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:03:59,195 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:03:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:59,456 INFO L93 Difference]: Finished difference Result 3109 states and 4481 transitions. [2022-02-21 03:03:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4481 transitions. [2022-02-21 03:03:59,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:59,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:59,464 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:03:59,465 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:03:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:59,721 INFO L93 Difference]: Finished difference Result 3109 states and 4481 transitions. [2022-02-21 03:03:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4481 transitions. [2022-02-21 03:03:59,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:59,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:59,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:59,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:59,725 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:03:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3343 transitions. [2022-02-21 03:03:59,862 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3343 transitions. Word has length 21 [2022-02-21 03:03:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:59,862 INFO L470 AbstractCegarLoop]: Abstraction has 2296 states and 3343 transitions. [2022-02-21 03:03:59,862 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:03:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3343 transitions. [2022-02-21 03:03:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:03:59,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:59,863 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2022-02-21 03:03:59,881 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:04:00,063 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:04:00,064 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:04:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1881216384, now seen corresponding path program 1 times [2022-02-21 03:04:00,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:00,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010802586] [2022-02-21 03:04:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:00,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {46253#true} assume { :begin_inline_ULTIMATE.init } true; {46253#true} is VALID [2022-02-21 03:04:00,116 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:00,117 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:04:00,117 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:04:00,117 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:04:00,118 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:04:00,118 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:04:00,118 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:04:00,119 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:04:00,119 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:04:00,120 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:04:00,120 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:04:00,120 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:04:00,121 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:04:00,121 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:04:00,121 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:04:00,122 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:04:00,122 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:04:00,122 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:04:00,123 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:04:00,123 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:04:00,124 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:04:00,124 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:04:00,124 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:04:00,125 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:04:00,125 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:04:00,126 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:04:00,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:00,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010802586] [2022-02-21 03:04:00,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010802586] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:00,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884224569] [2022-02-21 03:04:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:00,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:00,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:00,128 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:04:00,129 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:04:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:00,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:00,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:00,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {46253#true} assume { :begin_inline_ULTIMATE.init } true; {46253#true} is VALID [2022-02-21 03:04:00,258 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:00,262 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:04:00,263 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:04:00,264 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:04:00,264 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:04:00,264 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:04:00,265 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:04:00,265 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:04:00,266 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:04:00,266 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:04:00,267 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:04:00,267 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:04:00,267 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:04:00,268 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:04:00,269 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:04:00,270 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:04:00,270 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:04:00,270 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:04:00,271 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:04:00,271 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:04:00,271 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:04:00,272 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:04:00,272 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:04:00,272 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:04:00,272 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:04:00,273 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:04:00,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:00,399 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:04:00,399 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:04:00,399 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:04:00,400 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:04:00,400 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:04:00,400 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:04:00,401 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:04:00,401 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:04:00,401 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:04:00,402 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:04:00,402 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:04:00,402 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:04:00,402 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:04:00,403 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:04:00,403 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:04:00,406 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:04:00,406 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:04:00,407 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:04:00,407 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:04:00,407 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:04:00,407 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:04:00,408 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:04:00,408 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:04:00,408 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:04:00,408 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:00,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {46253#true} assume { :begin_inline_ULTIMATE.init } true; {46253#true} is VALID [2022-02-21 03:04:00,409 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:04:00,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884224569] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:00,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:00,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:04:00,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010228713] [2022-02-21 03:04:00,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:00,410 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:04:00,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:00,410 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:04:00,439 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:00,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:04:00,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:04:00,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:00,439 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:04:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:03,240 INFO L93 Difference]: Finished difference Result 6601 states and 9698 transitions. [2022-02-21 03:04:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:04:03,240 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:04:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:03,240 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:04:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:04:03,241 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:04:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:04:03,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2022-02-21 03:04:03,370 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:04:04,662 INFO L225 Difference]: With dead ends: 6601 [2022-02-21 03:04:04,662 INFO L226 Difference]: Without dead ends: 6600 [2022-02-21 03:04:04,664 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:04:04,665 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:04:04,665 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:04:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6600 states. [2022-02-21 03:04:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6600 to 5401. [2022-02-21 03:04:05,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,949 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:04:05,952 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:04:05,955 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:04:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:07,109 INFO L93 Difference]: Finished difference Result 6600 states and 9477 transitions. [2022-02-21 03:04:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 9477 transitions. [2022-02-21 03:04:07,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:07,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:07,119 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:04:07,122 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:04:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,312 INFO L93 Difference]: Finished difference Result 6600 states and 9477 transitions. [2022-02-21 03:04:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 9477 transitions. [2022-02-21 03:04:08,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:08,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:08,323 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:04:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7853 transitions. [2022-02-21 03:04:09,073 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7853 transitions. Word has length 26 [2022-02-21 03:04:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:09,073 INFO L470 AbstractCegarLoop]: Abstraction has 5401 states and 7853 transitions. [2022-02-21 03:04:09,073 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:04:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7853 transitions. [2022-02-21 03:04:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:04:09,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:09,074 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2022-02-21 03:04:09,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-21 03:04:09,277 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:04:09,278 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:04:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash -205460357, now seen corresponding path program 1 times [2022-02-21 03:04:09,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:09,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500565463] [2022-02-21 03:04:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:09,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {72486#true} assume { :begin_inline_ULTIMATE.init } true; {72486#true} is VALID [2022-02-21 03:04:09,314 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:09,315 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:04:09,315 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:04:09,315 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:04:09,315 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:04:09,316 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:04:09,316 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:04:09,316 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:04:09,317 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:04:09,317 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:04:09,317 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:04:09,318 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:04:09,318 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:04:09,318 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:04:09,318 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:04:09,319 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:04:09,319 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:04:09,319 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:04:09,319 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:04:09,320 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:04:09,320 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:04:09,320 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:04:09,321 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:04:09,321 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:04:09,321 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:04:09,322 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:04:09,322 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:04:09,322 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:04:09,323 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:04:09,323 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:04:09,323 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:04:09,324 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:04:09,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:09,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500565463] [2022-02-21 03:04:09,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500565463] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:09,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351391920] [2022-02-21 03:04:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:09,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:09,326 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:04:09,327 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:04:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:09,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:09,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:09,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {72486#true} assume { :begin_inline_ULTIMATE.init } true; {72486#true} is VALID [2022-02-21 03:04:09,502 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:09,503 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:04:09,503 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:04:09,503 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:04:09,503 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:04:09,504 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:04:09,504 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:04:09,504 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:04:09,505 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:04:09,505 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:04:09,505 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:04:09,505 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:04:09,506 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:04:09,506 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:04:09,506 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:04:09,507 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:04:09,507 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:04:09,507 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:04:09,507 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:04:09,508 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:04:09,508 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:04:09,508 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:04:09,509 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:04:09,509 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:04:09,509 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:04:09,510 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:04:09,510 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:04:09,510 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:04:09,510 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:04:09,511 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:04:09,511 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:04:09,511 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:04:09,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:09,650 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:04:09,650 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:04:09,651 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:04:09,651 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:04:09,651 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:04:09,652 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:04:09,652 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:04:09,657 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:04:09,657 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:04:09,657 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:04:09,658 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:04:09,658 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:04:09,658 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:04:09,658 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:04:09,659 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:04:09,660 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:04:09,661 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:04:09,661 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:04:09,661 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:04:09,661 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:04:09,662 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:04:09,662 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:04:09,662 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:04:09,663 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:04:09,663 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:04:09,663 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:04:09,663 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:04:09,664 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:04:09,664 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:04:09,664 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:04:09,665 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:09,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {72486#true} assume { :begin_inline_ULTIMATE.init } true; {72486#true} is VALID [2022-02-21 03:04:09,665 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:04:09,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351391920] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:09,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:09,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:04:09,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477860532] [2022-02-21 03:04:09,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:09,666 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:04:09,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:09,666 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:04:09,701 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:04:09,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:04:09,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:09,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:04:09,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:09,702 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:04:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:20,105 INFO L93 Difference]: Finished difference Result 15529 states and 22802 transitions. [2022-02-21 03:04:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:04:20,106 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:04:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:20,106 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:04:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:04:20,107 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:04:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2022-02-21 03:04:20,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2022-02-21 03:04:20,234 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:04:27,109 INFO L225 Difference]: With dead ends: 15529 [2022-02-21 03:04:27,110 INFO L226 Difference]: Without dead ends: 15528 [2022-02-21 03:04:27,115 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:04:27,115 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:04:27,115 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:04:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2022-02-21 03:04:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 12718. [2022-02-21 03:04:30,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:30,343 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:04:30,351 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:04:30,359 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:04:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:36,209 INFO L93 Difference]: Finished difference Result 15528 states and 22275 transitions. [2022-02-21 03:04:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 22275 transitions. [2022-02-21 03:04:36,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:36,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:36,233 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:04:36,242 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:04:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:43,074 INFO L93 Difference]: Finished difference Result 15528 states and 22275 transitions. [2022-02-21 03:04:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 22275 transitions. [2022-02-21 03:04:43,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:43,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:43,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:43,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:43,139 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:04:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 18447 transitions. [2022-02-21 03:04:47,647 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 18447 transitions. Word has length 32 [2022-02-21 03:04:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:47,648 INFO L470 AbstractCegarLoop]: Abstraction has 12718 states and 18447 transitions. [2022-02-21 03:04:47,648 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:04:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 18447 transitions. [2022-02-21 03:04:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 03:04:47,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:47,649 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2022-02-21 03:04:47,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:47,850 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:04:47,851 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:04:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1919460695, now seen corresponding path program 2 times [2022-02-21 03:04:47,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:47,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862064325] [2022-02-21 03:04:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:47,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {134062#true} assume { :begin_inline_ULTIMATE.init } true; {134062#true} is VALID [2022-02-21 03:04:47,903 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:47,904 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:04:47,904 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:04:47,904 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:04:47,905 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:04:47,905 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:04:47,905 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:04:47,905 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:04:47,906 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:04:47,906 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:04:47,906 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:04:47,907 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:04:47,907 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:04:47,907 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:04:47,907 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:04:47,908 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:04:47,908 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:04:47,908 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:04:47,909 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:04:47,909 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:04:47,909 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:04:47,909 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:04:47,910 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:04:47,910 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:04:47,910 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:04:47,910 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:04:47,911 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:04:47,911 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:04:47,911 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:04:47,912 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:04:47,916 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:04:47,916 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:04:47,917 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:04:47,917 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:04:47,917 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:04:47,917 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:04:47,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:47,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862064325] [2022-02-21 03:04:47,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862064325] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:47,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514713089] [2022-02-21 03:04:47,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:47,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:47,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:47,928 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:04:47,928 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:04:47,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:04:47,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:47,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:04:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:47,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:48,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {134062#true} assume { :begin_inline_ULTIMATE.init } true; {134062#true} is VALID [2022-02-21 03:04:48,093 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:48,093 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:04:48,093 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:04:48,093 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:04:48,094 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:04:48,094 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:04:48,094 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:04:48,095 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:04:48,095 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:04:48,095 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:04:48,095 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:04:48,096 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:04:48,096 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:04:48,096 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:04:48,097 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:04:48,104 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:04:48,104 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:04:48,104 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:04:48,105 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:04:48,105 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:04:48,105 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:04:48,105 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:04:48,106 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:04:48,106 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:04:48,106 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:04:48,106 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:04:48,107 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:04:48,107 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:04:48,107 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:04:48,108 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:04:48,108 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:04:48,108 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:04:48,108 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:04:48,109 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:04:48,109 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:04:48,109 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:04:48,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:48,290 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:04:48,290 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:04:48,290 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:04:48,291 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:04:48,291 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:04:48,291 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:04:48,292 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:04:48,292 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:04:48,292 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:04:48,293 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:04:48,293 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:04:48,293 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:04:48,295 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:04:48,296 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:04:48,296 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:04:48,296 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:04:48,297 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:04:48,297 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:04:48,297 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:04:48,301 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:04:48,301 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:04:48,301 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:04:48,302 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:04:48,302 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:04:48,302 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:04:48,302 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:04:48,303 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:04:48,303 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:04:48,303 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:04:48,304 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:04:48,304 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:04:48,304 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:04:48,305 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:04:48,305 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:04:48,305 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_~N~0#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~r~0#1;havoc main_~N~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~i~0#1;havoc main_~r~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:04:48,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {134062#true} assume { :begin_inline_ULTIMATE.init } true; {134062#true} is VALID [2022-02-21 03:04:48,305 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:04:48,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514713089] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:48,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:48,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:04:48,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236334847] [2022-02-21 03:04:48,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:48,307 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:04:48,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:48,307 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:04:48,359 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:04:48,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:04:48,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:48,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:04:48,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:04:48,360 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)