./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1-modified.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/BradleyMannaSipma-CAV2005-Fig1-modified.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 c8c2842840d9df2fd19d5532fbc3700c74bea362cad75e31db6c666eb38ff4df --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:05,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:05,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:05,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:05,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:05,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:05,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:05,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:05,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:05,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:05,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:05,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:05,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:05,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:05,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:05,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:05,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:05,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:05,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:05,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:05,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:05,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:05,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:05,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:05,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:05,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:05,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:05,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:05,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:05,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:05,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:05,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:05,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:05,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:05,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:05,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:05,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:05,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:05,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:05,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:05,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:05,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:06,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:06,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:06,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:06,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:06,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:06,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:06,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:06,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:06,022 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:06,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:06,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:06,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:06,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:06,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:06,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:06,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:06,024 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:06,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:06,024 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:06,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:06,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:06,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:06,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:06,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:06,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:06,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:06,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:06,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:06,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:06,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:06,027 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 -> c8c2842840d9df2fd19d5532fbc3700c74bea362cad75e31db6c666eb38ff4df [2022-02-21 03:04:06,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:06,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:06,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:06,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:06,251 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:06,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1-modified.c [2022-02-21 03:04:06,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f80da46/16decfdff3ad4c42a2d0381b34d87ee0/FLAGddbd16fce [2022-02-21 03:04:06,586 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:06,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1-modified.c [2022-02-21 03:04:06,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f80da46/16decfdff3ad4c42a2d0381b34d87ee0/FLAGddbd16fce [2022-02-21 03:04:07,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f80da46/16decfdff3ad4c42a2d0381b34d87ee0 [2022-02-21 03:04:07,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:07,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:07,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:07,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:07,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:07,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2283fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07, skipping insertion in model container [2022-02-21 03:04:07,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:07,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:07,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:07,191 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:07,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:07,223 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:07,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07 WrapperNode [2022-02-21 03:04:07,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:07,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:07,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:07,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:07,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,246 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-02-21 03:04:07,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:07,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:07,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:07,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:07,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:07,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:07,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:07,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:07,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:07,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:07,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:07,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:07,371 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:07,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:07,488 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:07,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:07,505 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:04:07,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:07 BoogieIcfgContainer [2022-02-21 03:04:07,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:07,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:07,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:07,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:07,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:07" (1/3) ... [2022-02-21 03:04:07,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17db9906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:07, skipping insertion in model container [2022-02-21 03:04:07,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (2/3) ... [2022-02-21 03:04:07,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17db9906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:07, skipping insertion in model container [2022-02-21 03:04:07,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:07" (3/3) ... [2022-02-21 03:04:07,524 INFO L111 eAbstractionObserver]: Analyzing ICFG BradleyMannaSipma-CAV2005-Fig1-modified.c [2022-02-21 03:04:07,527 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:07,530 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:04:07,560 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:07,567 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:07,567 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:04:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call 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,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:07,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:07,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:07,582 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 889513677, now seen corresponding path program 1 times [2022-02-21 03:04:07,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:07,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448028070] [2022-02-21 03:04:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:07,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true; {20#true} is VALID [2022-02-21 03:04:07,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {22#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:07,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {23#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:07,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {23#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:07,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y1~0#1 > main_~y2~0#1; {23#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:07,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !(main_~y1~0#1 - main_~y2~0#1 <= 2147483647); {21#false} is VALID [2022-02-21 03:04:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:07,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:07,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448028070] [2022-02-21 03:04:07,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448028070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:07,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:07,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:07,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243897668] [2022-02-21 03:04:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:07,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:07,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:07,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:07,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:07,837 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:07,959 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-21 03:04:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:07,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-21 03:04:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-21 03:04:07,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-21 03:04:08,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,015 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:04:08,016 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:04:08,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:08,030 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:08,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 13 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:04:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:04:08,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:08,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,056 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,056 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,061 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:04:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:04:08,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:04:08,062 INFO L87 Difference]: Start difference. First operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:04:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,069 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:04:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:04:08,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:08,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:04:08,073 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 6 [2022-02-21 03:04:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:08,073 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:04:08,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:04:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:08,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:08,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:08,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:08,075 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash 889513869, now seen corresponding path program 1 times [2022-02-21 03:04:08,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:08,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052212342] [2022-02-21 03:04:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:08,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true; {109#true} is VALID [2022-02-21 03:04:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {111#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} is VALID [2022-02-21 03:04:08,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {112#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:08,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {112#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:08,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {112#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {112#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:08,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {110#false} is VALID [2022-02-21 03:04:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:08,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:08,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052212342] [2022-02-21 03:04:08,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052212342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:08,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:08,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:08,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656431053] [2022-02-21 03:04:08,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:08,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:08,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:08,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:08,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:08,151 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,200 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:04:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:08,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:04:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:04:08,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-02-21 03:04:08,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,217 INFO L225 Difference]: With dead ends: 17 [2022-02-21 03:04:08,217 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:04:08,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:08,218 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:08,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 4 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:04:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:04:08,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:08,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,225 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,225 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,226 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:04:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:04:08,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:04:08,227 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:04:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,228 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:04:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:04:08,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:08,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:04:08,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 6 [2022-02-21 03:04:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:08,230 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:04:08,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:04:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:08,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:08,231 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:08,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:08,231 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash -947744184, now seen corresponding path program 1 times [2022-02-21 03:04:08,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:08,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382356903] [2022-02-21 03:04:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:08,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:08,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true; {183#true} is VALID [2022-02-21 03:04:08,275 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_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {185#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:08,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} is VALID [2022-02-21 03:04:08,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} assume !!(main_~y1~0#1 != main_~y2~0#1); {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} is VALID [2022-02-21 03:04:08,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} assume main_~y1~0#1 > main_~y2~0#1; {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} is VALID [2022-02-21 03:04:08,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} is VALID [2022-02-21 03:04:08,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y2~0#1|)))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {187#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:08,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {187#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:08,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y1~0#1 > main_~y2~0#1; {187#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:08,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !(main_~y1~0#1 - main_~y2~0#1 <= 2147483647); {184#false} is VALID [2022-02-21 03:04:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:08,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:08,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382356903] [2022-02-21 03:04:08,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382356903] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:08,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222603746] [2022-02-21 03:04:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:08,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:08,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:08,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:08,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:04:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:08,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:08,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:08,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true; {183#true} is VALID [2022-02-21 03:04:08,530 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_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {185#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:08,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:08,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume !!(main_~y1~0#1 != main_~y2~0#1); {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:08,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y1~0#1 > main_~y2~0#1; {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:08,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:08,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(and (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {210#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:08,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y2~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {210#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:08,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y1~0#1 > main_~y2~0#1; {210#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:08,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y2~0#1|))} assume !(main_~y1~0#1 - main_~y2~0#1 <= 2147483647); {184#false} is VALID [2022-02-21 03:04:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:08,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:04:08,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222603746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:08,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:04:08,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-02-21 03:04:08,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884129015] [2022-02-21 03:04:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:08,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:08,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:08,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:08,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:04:08,545 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,640 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-21 03:04:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-21 03:04:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-21 03:04:08,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-02-21 03:04:08,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,674 INFO L225 Difference]: With dead ends: 33 [2022-02-21 03:04:08,674 INFO L226 Difference]: Without dead ends: 32 [2022-02-21 03:04:08,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:04:08,675 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:08,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-21 03:04:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2022-02-21 03:04:08,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:08,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:08,694 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:08,695 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,698 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-21 03:04:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-21 03:04:08,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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 32 states. [2022-02-21 03:04:08,699 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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 32 states. [2022-02-21 03:04:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,704 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-21 03:04:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-21 03:04:08,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:08,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-21 03:04:08,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-02-21 03:04:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:08,706 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:04:08,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:04:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:08,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:08,706 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:08,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:04:08,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:08,912 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash -947743992, now seen corresponding path program 1 times [2022-02-21 03:04:08,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:08,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606084060] [2022-02-21 03:04:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:08,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:08,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} assume { :begin_inline_ULTIMATE.init } true; {341#true} is VALID [2022-02-21 03:04:08,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {343#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} is VALID [2022-02-21 03:04:08,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {343#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} is VALID [2022-02-21 03:04:08,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {343#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {343#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} is VALID [2022-02-21 03:04:08,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {343#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} assume main_~y1~0#1 > main_~y2~0#1; {344#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} is VALID [2022-02-21 03:04:08,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {344#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} is VALID [2022-02-21 03:04:08,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {345#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} is VALID [2022-02-21 03:04:08,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} assume !!(main_~y1~0#1 != main_~y2~0#1); {345#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} is VALID [2022-02-21 03:04:08,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} assume !(main_~y1~0#1 > main_~y2~0#1); {345#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} is VALID [2022-02-21 03:04:08,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 2147483646))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {342#false} is VALID [2022-02-21 03:04:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:08,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:09,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606084060] [2022-02-21 03:04:09,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606084060] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:09,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078803516] [2022-02-21 03:04:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:09,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:09,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:04:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:09,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:09,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:09,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} assume { :begin_inline_ULTIMATE.init } true; {341#true} is VALID [2022-02-21 03:04:09,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {352#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:09,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {352#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:09,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {352#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {352#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:09,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {352#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 > main_~y2~0#1; {362#(and (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:09,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#(and (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {362#(and (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:09,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(and (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {369#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< |ULTIMATE.start_main_~y2~0#1| 2147483647))} is VALID [2022-02-21 03:04:09,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< |ULTIMATE.start_main_~y2~0#1| 2147483647))} assume !!(main_~y1~0#1 != main_~y2~0#1); {369#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< |ULTIMATE.start_main_~y2~0#1| 2147483647))} is VALID [2022-02-21 03:04:09,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< |ULTIMATE.start_main_~y2~0#1| 2147483647))} assume !(main_~y1~0#1 > main_~y2~0#1); {369#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< |ULTIMATE.start_main_~y2~0#1| 2147483647))} is VALID [2022-02-21 03:04:09,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< |ULTIMATE.start_main_~y2~0#1| 2147483647))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {342#false} is VALID [2022-02-21 03:04:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:09,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:25,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {379#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {342#false} is VALID [2022-02-21 03:04:25,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {379#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:25,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {379#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:25,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {389#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {379#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:25,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {389#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:25,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {396#(<= |ULTIMATE.start_main_~y1~0#1| (+ (div (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|) 2) 1))} assume main_~y1~0#1 > main_~y2~0#1; {389#(<= (* 2 |ULTIMATE.start_main_~y2~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:25,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {396#(<= |ULTIMATE.start_main_~y1~0#1| (+ (div (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|) 2) 1))} assume !!(main_~y1~0#1 != main_~y2~0#1); {396#(<= |ULTIMATE.start_main_~y1~0#1| (+ (div (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|) 2) 1))} is VALID [2022-02-21 03:04:25,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#(<= |ULTIMATE.start_main_~y1~0#1| (+ (div (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|) 2) 1))} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {396#(<= |ULTIMATE.start_main_~y1~0#1| (+ (div (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|) 2) 1))} is VALID [2022-02-21 03:04:25,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {396#(<= |ULTIMATE.start_main_~y1~0#1| (+ (div (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|) 2) 1))} is VALID [2022-02-21 03:04:25,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} assume { :begin_inline_ULTIMATE.init } true; {341#true} is VALID [2022-02-21 03:04:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:25,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078803516] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:25,492 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:25,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-02-21 03:04:25,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232412542] [2022-02-21 03:04:25,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:25,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:25,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:25,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:25,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:04:25,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:25,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:04:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:04:25,542 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:25,894 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-21 03:04:25,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:04:25,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-02-21 03:04:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-02-21 03:04:25,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2022-02-21 03:04:25,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:25,935 INFO L225 Difference]: With dead ends: 44 [2022-02-21 03:04:25,936 INFO L226 Difference]: Without dead ends: 43 [2022-02-21 03:04:25,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:04:25,941 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:25,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 8 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:04:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-21 03:04:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2022-02-21 03:04:25,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:25,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:25,975 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:25,975 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:25,980 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-21 03:04:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-02-21 03:04:25,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:25,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:25,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 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 43 states. [2022-02-21 03:04:25,981 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 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 43 states. [2022-02-21 03:04:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:25,988 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-21 03:04:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-02-21 03:04:25,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:25,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:25,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:25,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-21 03:04:25,990 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 10 [2022-02-21 03:04:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:25,990 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-21 03:04:25,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-21 03:04:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:25,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:25,991 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:26,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:26,208 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,SelfDestructingSolverStorable3 [2022-02-21 03:04:26,208 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:26,209 INFO L85 PathProgramCache]: Analyzing trace with hash -770249406, now seen corresponding path program 1 times [2022-02-21 03:04:26,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:26,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100148504] [2022-02-21 03:04:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:26,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#true} assume { :begin_inline_ULTIMATE.init } true; {600#true} is VALID [2022-02-21 03:04:26,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:26,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:26,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:26,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume !(main_~y1~0#1 > main_~y2~0#1); {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y1~0#1 > main_~y2~0#1; {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !(main_~y1~0#1 - main_~y2~0#1 <= 2147483647); {601#false} is VALID [2022-02-21 03:04:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:26,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:26,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100148504] [2022-02-21 03:04:26,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100148504] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:26,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558055896] [2022-02-21 03:04:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:26,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:26,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:04:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:26,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:04:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:26,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:26,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#true} assume { :begin_inline_ULTIMATE.init } true; {600#true} is VALID [2022-02-21 03:04:26,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:26,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:26,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {602#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {617#(and (not (= |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|)) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:26,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {617#(and (not (= |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|)) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume !(main_~y1~0#1 > main_~y2~0#1); {621#(and (not (= |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|)) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:26,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#(and (not (= |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|)) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {621#(and (not (= |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|)) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:26,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#(and (not (= |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|)) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {628#(and (< 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:26,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (< 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume !!(main_~y1~0#1 != main_~y2~0#1); {628#(and (< 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:26,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (< 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume main_~y1~0#1 > main_~y2~0#1; {628#(and (< 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} is VALID [2022-02-21 03:04:26,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(and (< 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647))} assume !(main_~y1~0#1 - main_~y2~0#1 <= 2147483647); {601#false} is VALID [2022-02-21 03:04:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:26,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:26,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !(main_~y1~0#1 - main_~y2~0#1 <= 2147483647); {601#false} is VALID [2022-02-21 03:04:26,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y1~0#1 > main_~y2~0#1; {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {604#(<= |ULTIMATE.start_main_~y1~0#1| (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {653#(or (<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|)) (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {603#(<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-21 03:04:26,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {657#(<= |ULTIMATE.start_main_~y1~0#1| 2147483648)} assume !!(main_~y1~0#1 != main_~y2~0#1); {653#(or (<= (* 2 |ULTIMATE.start_main_~y1~0#1|) (+ 2147483647 |ULTIMATE.start_main_~y2~0#1|)) (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:26,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= |ULTIMATE.start_main_~y1~0#1| 2147483648)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {657#(<= |ULTIMATE.start_main_~y1~0#1| 2147483648)} is VALID [2022-02-21 03:04:26,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {657#(<= |ULTIMATE.start_main_~y1~0#1| 2147483648)} is VALID [2022-02-21 03:04:26,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#true} assume { :begin_inline_ULTIMATE.init } true; {600#true} is VALID [2022-02-21 03:04:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:26,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558055896] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:26,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:26,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2022-02-21 03:04:26,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636757776] [2022-02-21 03:04:26,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:26,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:26,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:26,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:26,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:26,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:04:26,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:04:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:04:26,684 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:26,842 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-02-21 03:04:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:04:26,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-02-21 03:04:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-02-21 03:04:26,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2022-02-21 03:04:26,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:26,865 INFO L225 Difference]: With dead ends: 36 [2022-02-21 03:04:26,865 INFO L226 Difference]: Without dead ends: 35 [2022-02-21 03:04:26,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:04:26,867 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:26,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-21 03:04:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-02-21 03:04:26,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:26,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:26,893 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:26,893 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:26,894 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-21 03:04:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-21 03:04:26,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:26,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:26,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 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 35 states. [2022-02-21 03:04:26,895 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 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 35 states. [2022-02-21 03:04:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:26,896 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-21 03:04:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-21 03:04:26,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:26,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:26,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:26,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-02-21 03:04:26,897 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 10 [2022-02-21 03:04:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:26,897 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-21 03:04:26,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-21 03:04:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:26,898 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:26,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:26,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:27,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:27,117 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash -770249214, now seen corresponding path program 1 times [2022-02-21 03:04:27,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:27,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568640686] [2022-02-21 03:04:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:27,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {815#true} assume { :begin_inline_ULTIMATE.init } true; {815#true} is VALID [2022-02-21 03:04:27,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {817#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {817#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:27,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume !!(main_~y1~0#1 != main_~y2~0#1); {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:27,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume !(main_~y1~0#1 > main_~y2~0#1); {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:27,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:27,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {819#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {819#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {819#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {819#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {819#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {819#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {816#false} is VALID [2022-02-21 03:04:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:27,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:27,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568640686] [2022-02-21 03:04:27,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568640686] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:27,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24041917] [2022-02-21 03:04:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:27,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:27,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:27,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:27,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:04:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:27,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:27,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:27,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {815#true} assume { :begin_inline_ULTIMATE.init } true; {815#true} is VALID [2022-02-21 03:04:27,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {817#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {817#(<= |ULTIMATE.start_main_~y2~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {829#(and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {842#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {842#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {842#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {816#false} is VALID [2022-02-21 03:04:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:27,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:04:27,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24041917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:27,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:04:27,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-02-21 03:04:27,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284248314] [2022-02-21 03:04:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:27,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:27,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:27,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:27,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:04:27,294 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:27,384 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-21 03:04:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:27,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:04:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:04:27,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-21 03:04:27,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:27,419 INFO L225 Difference]: With dead ends: 44 [2022-02-21 03:04:27,420 INFO L226 Difference]: Without dead ends: 43 [2022-02-21 03:04:27,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:04:27,420 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:27,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-21 03:04:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 21. [2022-02-21 03:04:27,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:27,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,436 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,436 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:27,438 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-02-21 03:04:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-21 03:04:27,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:27,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:27,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-21 03:04:27,439 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-21 03:04:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:27,440 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-02-21 03:04:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-21 03:04:27,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:27,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:27,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:27,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-21 03:04:27,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2022-02-21 03:04:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:27,443 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:04:27,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:04:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:04:27,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:27,443 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:27,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:27,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:27,663 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:27,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:27,664 INFO L85 PathProgramCache]: Analyzing trace with hash 118514808, now seen corresponding path program 1 times [2022-02-21 03:04:27,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:27,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405181545] [2022-02-21 03:04:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:27,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {1014#true} assume { :begin_inline_ULTIMATE.init } true; {1014#true} is VALID [2022-02-21 03:04:27,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 > main_~y2~0#1; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} is VALID [2022-02-21 03:04:27,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} is VALID [2022-02-21 03:04:27,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} assume main_~y1~0#1 > main_~y2~0#1; {1018#(<= (* 3 |ULTIMATE.start_main_~y2~0#1|) (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} is VALID [2022-02-21 03:04:27,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#(<= (* 3 |ULTIMATE.start_main_~y2~0#1|) (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {1018#(<= (* 3 |ULTIMATE.start_main_~y2~0#1|) (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} is VALID [2022-02-21 03:04:27,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {1018#(<= (* 3 |ULTIMATE.start_main_~y2~0#1|) (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} is VALID [2022-02-21 03:04:27,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} is VALID [2022-02-21 03:04:27,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} assume !(main_~y1~0#1 > main_~y2~0#1); {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} is VALID [2022-02-21 03:04:27,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} is VALID [2022-02-21 03:04:27,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#(<= |ULTIMATE.start_main_~y2~0#1| (+ (* 2 |ULTIMATE.start_main_~y1~0#1|) 1073741821))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {1020#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 1073741821))} is VALID [2022-02-21 03:04:27,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1020#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 1073741821))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1020#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 1073741821))} is VALID [2022-02-21 03:04:27,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1020#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 1073741821))} assume !(main_~y1~0#1 > main_~y2~0#1); {1020#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 1073741821))} is VALID [2022-02-21 03:04:27,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {1020#(<= |ULTIMATE.start_main_~y2~0#1| (+ |ULTIMATE.start_main_~y1~0#1| 1073741821))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {1015#false} is VALID [2022-02-21 03:04:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:27,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:27,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405181545] [2022-02-21 03:04:27,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405181545] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:27,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851803369] [2022-02-21 03:04:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:27,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:27,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:27,737 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:27,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:04:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:27,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:04:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:27,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:27,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {1014#true} assume { :begin_inline_ULTIMATE.init } true; {1014#true} is VALID [2022-02-21 03:04:27,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 > main_~y2~0#1; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} is VALID [2022-02-21 03:04:27,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1016#(<= |ULTIMATE.start_main_~y1~0#1| 2147483647)} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} is VALID [2022-02-21 03:04:27,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} assume !!(main_~y1~0#1 != main_~y2~0#1); {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} is VALID [2022-02-21 03:04:27,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647)} assume main_~y1~0#1 > main_~y2~0#1; {1048#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|))} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {1048#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:27,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(and (<= (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 2147483647) (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|))} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} is VALID [2022-02-21 03:04:27,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} is VALID [2022-02-21 03:04:27,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} assume !(main_~y1~0#1 > main_~y2~0#1); {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} is VALID [2022-02-21 03:04:27,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} is VALID [2022-02-21 03:04:27,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1055#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (* 2 |ULTIMATE.start_main_~y2~0#1|) 2147483647))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {1068#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 1073741824))} is VALID [2022-02-21 03:04:27,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {1068#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 1073741824))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1068#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 1073741824))} is VALID [2022-02-21 03:04:27,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 1073741824))} assume !(main_~y1~0#1 > main_~y2~0#1); {1068#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 1073741824))} is VALID [2022-02-21 03:04:27,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1068#(and (< 0 |ULTIMATE.start_main_~y1~0#1|) (< (+ |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~y2~0#1|) 1073741824))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {1015#false} is VALID [2022-02-21 03:04:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:27,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:44,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {1078#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y2~0#1 - main_~y1~0#1 <= 2147483647); {1015#false} is VALID [2022-02-21 03:04:44,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {1078#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !(main_~y1~0#1 > main_~y2~0#1); {1078#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:44,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {1078#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1078#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:44,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume main_~y2~0#1 - main_~y1~0#1 >= -2147483648;main_~y2~0#1 := main_~y2~0#1 - main_~y1~0#1; {1078#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 |ULTIMATE.start_main_~y1~0#1|))} is VALID [2022-02-21 03:04:44,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume main_~y2~0#1 - main_~y1~0#1 <= 2147483647; {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:44,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume !(main_~y1~0#1 > main_~y2~0#1); {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:44,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:44,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {1101#(<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|)} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {1088#(<= |ULTIMATE.start_main_~y2~0#1| (+ 2147483647 (* 2 |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:44,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {1101#(<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|)} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {1101#(<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|)} is VALID [2022-02-21 03:04:44,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#(or (<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)))} assume main_~y1~0#1 > main_~y2~0#1; {1101#(<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|)} is VALID [2022-02-21 03:04:44,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {1108#(or (<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)))} assume !!(main_~y1~0#1 != main_~y2~0#1); {1108#(or (<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:44,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} assume main_~y1~0#1 - main_~y2~0#1 >= -2147483648;main_~y1~0#1 := main_~y1~0#1 - main_~y2~0#1; {1108#(or (<= (+ (div (+ 2147483647 (* (- 1) |ULTIMATE.start_main_~y2~0#1|)) (- 2)) |ULTIMATE.start_main_~y2~0#1|) |ULTIMATE.start_main_~y1~0#1|) (not (< |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)))} is VALID [2022-02-21 03:04:44,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} assume main_~y1~0#1 - main_~y2~0#1 <= 2147483647; {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} is VALID [2022-02-21 03:04:44,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} assume main_~y1~0#1 > main_~y2~0#1; {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} is VALID [2022-02-21 03:04:44,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} assume !!(main_~y1~0#1 != main_~y2~0#1); {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} is VALID [2022-02-21 03:04:44,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} assume main_~y1~0#1 >= 0 && main_~y2~0#1 >= 0; {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} is VALID [2022-02-21 03:04:44,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {1014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~y1~0#1, main_~y2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~y1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1115#(<= (div (+ (- 1) (div (+ 4294967294 (* (- 1) |ULTIMATE.start_main_~y1~0#1|)) 2)) (- 2)) 2)} is VALID [2022-02-21 03:04:44,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {1014#true} assume { :begin_inline_ULTIMATE.init } true; {1014#true} is VALID [2022-02-21 03:04:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:44,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851803369] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:44,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:44,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-02-21 03:04:44,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915803475] [2022-02-21 03:04:44,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 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 18 [2022-02-21 03:04:44,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:44,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call 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:44,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:44,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:04:44,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:04:44,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:04:44,542 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call 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:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:45,192 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-21 03:04:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 03:04:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 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 18 [2022-02-21 03:04:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call 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:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-02-21 03:04:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call 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:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-02-21 03:04:45,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 53 transitions. [2022-02-21 03:04:45,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:45,237 INFO L225 Difference]: With dead ends: 53 [2022-02-21 03:04:45,237 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:45,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=731, Unknown=0, NotChecked=0, Total=1056 [2022-02-21 03:04:45,238 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:45,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:04:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:45,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:45,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call 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:45,239 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call 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:45,239 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call 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:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:45,239 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:45,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:45,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:45,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-21 03:04:45,240 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-21 03:04:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:45,240 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:45,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:45,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:45,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:45,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call 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:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:45,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-21 03:04:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:45,240 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:45,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call 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:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:45,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:45,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:04:45,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:04:45,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:04:45,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:04:45,260 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:04:45,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:45,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:04:45,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:04:45,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:04:45,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L854 garLoopResultBuilder]: At program point L29(lines 16 30) the Hoare annotation is: (<= |ULTIMATE.start_main_~y1~0#1| 2147483647) [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:04:45,613 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:04:45,614 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2022-02-21 03:04:45,614 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 28) no Hoare annotation was computed. [2022-02-21 03:04:45,614 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 21 27) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~y1~0#1|) (<= 0 |ULTIMATE.start_main_~y2~0#1|) (<= |ULTIMATE.start_main_~y1~0#1| 2147483647)) [2022-02-21 03:04:45,614 INFO L858 garLoopResultBuilder]: For program point L20-1(lines 20 28) no Hoare annotation was computed. [2022-02-21 03:04:45,616 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:45,618 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:45,621 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:04:45,622 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:04:45,622 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:45,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:45 BoogieIcfgContainer [2022-02-21 03:04:45,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:45,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:45,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:45,630 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:45,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:07" (3/4) ... [2022-02-21 03:04:45,632 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:04:45,640 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:04:45,640 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:04:45,640 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:04:45,661 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:45,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:45,662 INFO L158 Benchmark]: Toolchain (without parser) took 38615.92ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 66.1MB in the beginning and 71.3MB in the end (delta: -5.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:45,662 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:45,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.60ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 73.5MB in the end (delta: -7.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-21 03:04:45,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.96ms. Allocated memory is still 96.5MB. Free memory was 73.5MB in the beginning and 72.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:45,663 INFO L158 Benchmark]: Boogie Preprocessor took 11.41ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 71.1MB in the end (delta: 906.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:45,663 INFO L158 Benchmark]: RCFGBuilder took 247.91ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 60.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:45,664 INFO L158 Benchmark]: TraceAbstraction took 38121.10ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 60.6MB in the beginning and 73.4MB in the end (delta: -12.8MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-02-21 03:04:45,664 INFO L158 Benchmark]: Witness Printer took 31.04ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:45,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.60ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 73.5MB in the end (delta: -7.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.96ms. Allocated memory is still 96.5MB. Free memory was 73.5MB in the beginning and 72.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.41ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 71.1MB in the end (delta: 906.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.91ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 60.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38121.10ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 60.6MB in the beginning and 73.4MB in the end (delta: -12.8MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Witness Printer took 31.04ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 439 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 21 mSDtfsCounter, 439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=4, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 59 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 13 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 689 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 3 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 12/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: y1 <= 2147483647 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((y2 <= 2147483647 && 0 <= y1) && 0 <= y2) && y1 <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:04:45,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE