./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.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/PodelskiRybalchenko-TACAS2011-Fig3.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 ab66f9f89348f915f5a709aa03ac6e16c276dad15b53c460d26f0885e78d4ce7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:52,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:52,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:52,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:52,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:52,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:52,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:52,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:52,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:52,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:52,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:52,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:52,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:52,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:52,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:52,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:52,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:52,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:52,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:52,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:52,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:52,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:52,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:52,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:52,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:52,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:52,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:52,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:52,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:52,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:52,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:52,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:52,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:52,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:52,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:52,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:52,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:52,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:52,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:52,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:52,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:52,474 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:05:52,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:52,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:52,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:52,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:52,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:52,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:52,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:52,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:52,490 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:52,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:52,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:52,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:52,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:52,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:52,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:52,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:52,491 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:52,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:52,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:52,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:52,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:52,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:52,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:52,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:52,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:52,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:52,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:52,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:52,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:52,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:52,493 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 -> ab66f9f89348f915f5a709aa03ac6e16c276dad15b53c460d26f0885e78d4ce7 [2022-02-21 03:05:52,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:52,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:52,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:52,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:52,690 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:52,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.c [2022-02-21 03:05:52,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6599944/58d1f8fe91844673a76e7da8c2c32b94/FLAG33d4e5dc1 [2022-02-21 03:05:53,114 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:53,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.c [2022-02-21 03:05:53,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6599944/58d1f8fe91844673a76e7da8c2c32b94/FLAG33d4e5dc1 [2022-02-21 03:05:53,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6599944/58d1f8fe91844673a76e7da8c2c32b94 [2022-02-21 03:05:53,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:53,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:53,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:53,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:53,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:53,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e834fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53, skipping insertion in model container [2022-02-21 03:05:53,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:53,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:53,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:53,294 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:53,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:53,310 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:53,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53 WrapperNode [2022-02-21 03:05:53,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:53,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:53,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:53,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:53,317 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:05:53" (1/1) ... [2022-02-21 03:05:53,320 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:05:53" (1/1) ... [2022-02-21 03:05:53,332 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-02-21 03:05:53,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:53,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:53,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:53,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:53,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:53,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:53,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:53,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:53,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (1/1) ... [2022-02-21 03:05:53,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:53,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:53,375 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:05:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:53,407 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:05:53,433 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:53,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:53,560 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:53,564 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:53,565 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:05:53,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:53 BoogieIcfgContainer [2022-02-21 03:05:53,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:53,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:53,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:53,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:53,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:53" (1/3) ... [2022-02-21 03:05:53,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3195ec77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:53, skipping insertion in model container [2022-02-21 03:05:53,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:53" (2/3) ... [2022-02-21 03:05:53,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3195ec77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:53, skipping insertion in model container [2022-02-21 03:05:53,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:53" (3/3) ... [2022-02-21 03:05:53,571 INFO L111 eAbstractionObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig3.c [2022-02-21 03:05:53,579 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:53,579 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:05:53,627 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:53,644 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:05:53,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:05:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:53,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:53,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:53,670 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:05:53,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:53,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226541268] [2022-02-21 03:05:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:53,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true; {23#true} is VALID [2022-02-21 03:05:53,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#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_#t~nondet2#1, main_~old_x~0#1, main_~old_y~0#1, main_~x~0#1, main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {25#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:53,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);main_~old_x~0#1 := main_~x~0#1;main_~old_y~0#1 := main_~y~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {26#(<= |ULTIMATE.start_main_~old_y~0#1| 2147483647)} is VALID [2022-02-21 03:05:53,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#(<= |ULTIMATE.start_main_~old_y~0#1| 2147483647)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {26#(<= |ULTIMATE.start_main_~old_y~0#1| 2147483647)} is VALID [2022-02-21 03:05:53,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#(<= |ULTIMATE.start_main_~old_y~0#1| 2147483647)} assume !(main_~old_y~0#1 - 2 <= 2147483647); {24#false} is VALID [2022-02-21 03:05:53,811 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:05:53,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:53,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226541268] [2022-02-21 03:05:53,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226541268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:53,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:53,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:53,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235196791] [2022-02-21 03:05:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:53,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:53,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:53,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:53,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:53,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:53,847 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:53,970 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-21 03:05:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:05:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-21 03:05:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-21 03:05:53,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-21 03:05:54,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:54,019 INFO L225 Difference]: With dead ends: 47 [2022-02-21 03:05:54,019 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 03:05:54,021 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:05:54,023 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:54,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 03:05:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2022-02-21 03:05:54,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:54,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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:05:54,043 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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:05:54,044 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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:05:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,046 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-21 03:05:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-21 03:05:54,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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 30 states. [2022-02-21 03:05:54,047 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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 30 states. [2022-02-21 03:05:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,048 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-21 03:05:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-21 03:05:54,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:54,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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:05:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-21 03:05:54,051 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 5 [2022-02-21 03:05:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:54,052 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-21 03:05:54,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-21 03:05:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:54,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:54,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:54,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:54,053 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:54,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash 28699753, now seen corresponding path program 1 times [2022-02-21 03:05:54,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:54,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045046347] [2022-02-21 03:05:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:54,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#true} assume { :begin_inline_ULTIMATE.init } true; {166#true} is VALID [2022-02-21 03:05:54,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#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_#t~nondet2#1, main_~old_x~0#1, main_~old_y~0#1, main_~x~0#1, main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {168#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:54,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);main_~old_x~0#1 := main_~x~0#1;main_~old_y~0#1 := main_~y~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {169#(<= |ULTIMATE.start_main_~old_x~0#1| 2147483647)} is VALID [2022-02-21 03:05:54,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#(<= |ULTIMATE.start_main_~old_x~0#1| 2147483647)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {169#(<= |ULTIMATE.start_main_~old_x~0#1| 2147483647)} is VALID [2022-02-21 03:05:54,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#(<= |ULTIMATE.start_main_~old_x~0#1| 2147483647)} assume !(main_~old_x~0#1 - 1 <= 2147483647); {167#false} is VALID [2022-02-21 03:05:54,082 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:05:54,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:54,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045046347] [2022-02-21 03:05:54,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045046347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:54,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:54,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:54,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643301989] [2022-02-21 03:05:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:54,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:54,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:54,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:54,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:54,096 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,166 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-21 03:05:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:05:54,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:05:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:05:54,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-02-21 03:05:54,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:54,193 INFO L225 Difference]: With dead ends: 32 [2022-02-21 03:05:54,194 INFO L226 Difference]: Without dead ends: 31 [2022-02-21 03:05:54,195 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:05:54,201 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:54,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 25 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-21 03:05:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-02-21 03:05:54,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:54,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,218 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,219 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,221 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-21 03:05:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-21 03:05:54,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-21 03:05:54,234 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-21 03:05:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,236 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-21 03:05:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-21 03:05:54,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:54,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-21 03:05:54,244 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2022-02-21 03:05:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:54,245 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-21 03:05:54,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-21 03:05:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:54,246 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:54,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:54,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:54,246 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 889698349, now seen corresponding path program 1 times [2022-02-21 03:05:54,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:54,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468882900] [2022-02-21 03:05:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:54,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#true} assume { :begin_inline_ULTIMATE.init } true; {298#true} is VALID [2022-02-21 03:05:54,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#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_#t~nondet2#1, main_~old_x~0#1, main_~old_y~0#1, main_~x~0#1, main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {298#true} is VALID [2022-02-21 03:05:54,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {298#true} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);main_~old_x~0#1 := main_~x~0#1;main_~old_y~0#1 := main_~y~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {300#(<= 1 |ULTIMATE.start_main_~old_y~0#1|)} is VALID [2022-02-21 03:05:54,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {300#(<= 1 |ULTIMATE.start_main_~old_y~0#1|)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {300#(<= 1 |ULTIMATE.start_main_~old_y~0#1|)} is VALID [2022-02-21 03:05:54,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {300#(<= 1 |ULTIMATE.start_main_~old_y~0#1|)} assume main_~old_y~0#1 - 2 <= 2147483647; {300#(<= 1 |ULTIMATE.start_main_~old_y~0#1|)} is VALID [2022-02-21 03:05:54,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= 1 |ULTIMATE.start_main_~old_y~0#1|)} assume !(main_~old_y~0#1 - 2 >= -2147483648); {299#false} is VALID [2022-02-21 03:05:54,282 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:05:54,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:54,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468882900] [2022-02-21 03:05:54,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468882900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:54,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:54,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:54,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616491228] [2022-02-21 03:05:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:54,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:54,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,288 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:05:54,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:54,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:54,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:54,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:54,289 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,305 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-21 03:05:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:05:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:05:54,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-21 03:05:54,318 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:05:54,318 INFO L225 Difference]: With dead ends: 23 [2022-02-21 03:05:54,318 INFO L226 Difference]: Without dead ends: 22 [2022-02-21 03:05:54,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:54,320 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:54,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-21 03:05:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-21 03:05:54,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:54,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,329 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,329 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,330 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-21 03:05:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-21 03:05:54,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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 22 states. [2022-02-21 03:05:54,331 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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 22 states. [2022-02-21 03:05:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,331 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-21 03:05:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-21 03:05:54,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:54,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-21 03:05:54,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 6 [2022-02-21 03:05:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:54,333 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-21 03:05:54,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-21 03:05:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:54,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:54,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:54,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:54,335 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash 889692391, now seen corresponding path program 1 times [2022-02-21 03:05:54,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:54,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108772389] [2022-02-21 03:05:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:54,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} assume { :begin_inline_ULTIMATE.init } true; {398#true} is VALID [2022-02-21 03:05:54,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#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_#t~nondet2#1, main_~old_x~0#1, main_~old_y~0#1, main_~x~0#1, main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {398#true} is VALID [2022-02-21 03:05:54,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);main_~old_x~0#1 := main_~x~0#1;main_~old_y~0#1 := main_~y~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {400#(<= 1 |ULTIMATE.start_main_~old_x~0#1|)} is VALID [2022-02-21 03:05:54,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {400#(<= 1 |ULTIMATE.start_main_~old_x~0#1|)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {400#(<= 1 |ULTIMATE.start_main_~old_x~0#1|)} is VALID [2022-02-21 03:05:54,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {400#(<= 1 |ULTIMATE.start_main_~old_x~0#1|)} assume main_~old_x~0#1 - 1 <= 2147483647; {400#(<= 1 |ULTIMATE.start_main_~old_x~0#1|)} is VALID [2022-02-21 03:05:54,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#(<= 1 |ULTIMATE.start_main_~old_x~0#1|)} assume !(main_~old_x~0#1 - 1 >= -2147483648); {399#false} is VALID [2022-02-21 03:05:54,356 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:05:54,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:54,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108772389] [2022-02-21 03:05:54,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108772389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:54,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:54,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:54,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627017482] [2022-02-21 03:05:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:54,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,361 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:05:54,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:54,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:54,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:54,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:54,362 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,380 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-21 03:05:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:05:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:05:54,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-02-21 03:05:54,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:54,391 INFO L225 Difference]: With dead ends: 22 [2022-02-21 03:05:54,391 INFO L226 Difference]: Without dead ends: 20 [2022-02-21 03:05:54,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:54,392 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:54,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-21 03:05:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:05:54,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:54,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,403 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,403 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,404 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:05:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:05:54,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 03:05:54,405 INFO L87 Difference]: Start difference. First operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 03:05:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:54,408 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:05:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:05:54,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:54,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:54,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:54,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-21 03:05:54,410 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2022-02-21 03:05:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:54,410 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-21 03:05:54,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:05:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:05:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:05:54,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:54,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:54,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:05:54,412 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1810845099, now seen corresponding path program 1 times [2022-02-21 03:05:54,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:54,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583785723] [2022-02-21 03:05:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:54,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:05:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:54,439 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:05:54,439 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:05:54,440 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-02-21 03:05:54,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-02-21 03:05:54,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-02-21 03:05:54,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-02-21 03:05:54,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-02-21 03:05:54,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-02-21 03:05:54,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:05:54,444 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-21 03:05:54,448 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:54,462 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:54,462 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:54,462 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:54,462 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:54,463 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:54,463 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:05:54,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:54 BoogieIcfgContainer [2022-02-21 03:05:54,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:54,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:54,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:54,464 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:54,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:53" (3/4) ... [2022-02-21 03:05:54,466 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:05:54,484 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:54,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:54,485 INFO L158 Benchmark]: Toolchain (without parser) took 1346.48ms. Allocated memory is still 119.5MB. Free memory was 85.4MB in the beginning and 70.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2022-02-21 03:05:54,485 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory was 92.5MB in the beginning and 92.4MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:54,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.32ms. Allocated memory is still 119.5MB. Free memory was 85.1MB in the beginning and 95.8MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:54,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.89ms. Allocated memory is still 119.5MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:54,486 INFO L158 Benchmark]: Boogie Preprocessor took 9.82ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 93.8MB in the end (delta: 719.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:54,486 INFO L158 Benchmark]: RCFGBuilder took 223.30ms. Allocated memory is still 119.5MB. Free memory was 93.8MB in the beginning and 83.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:54,486 INFO L158 Benchmark]: TraceAbstraction took 896.87ms. Allocated memory is still 119.5MB. Free memory was 82.6MB in the beginning and 72.5MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:05:54,487 INFO L158 Benchmark]: Witness Printer took 20.22ms. Allocated memory is still 119.5MB. Free memory was 72.5MB in the beginning and 70.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:54,488 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.15ms. Allocated memory is still 119.5MB. Free memory was 92.5MB in the beginning and 92.4MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.32ms. Allocated memory is still 119.5MB. Free memory was 85.1MB in the beginning and 95.8MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.89ms. Allocated memory is still 119.5MB. Free memory was 95.8MB in the beginning and 94.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 9.82ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 93.8MB in the end (delta: 719.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 223.30ms. Allocated memory is still 119.5MB. Free memory was 93.8MB in the beginning and 83.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 896.87ms. Allocated memory is still 119.5MB. Free memory was 82.6MB in the beginning and 72.5MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 20.22ms. Allocated memory is still 119.5MB. Free memory was 72.5MB in the beginning and 70.4MB 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 - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int x = __VERIFIER_nondet_int(); [L13] int y = __VERIFIER_nondet_int(); [L14] COND TRUE x > 0 && y > 0 [L15] int old_x = x; [L16] int old_y = y; [L17] COND FALSE !(__VERIFIER_nondet_int()) [L21] EXPR old_y - 2 [L21] x = old_y - 2 VAL [old_x=2147483647, old_y=2, x=0, y=2] [L22] old_x + 1 VAL [old_x=2147483647, old_y=2, x=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 53 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:05:54,513 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)