./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1.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/GulwaniJainKoskinen-PLDI2009-Fig1.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 5ef97db69fbbc2686055433c5626a55a33ea2291308e3f5a177f7b8859d14e9c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:22,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:22,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:22,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:22,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:22,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:22,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:22,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:22,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:22,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:22,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:22,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:22,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:22,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:22,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:22,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:22,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:22,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:22,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:22,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:22,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:22,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:22,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:22,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:22,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:22,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:22,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:22,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:22,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:22,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:22,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:22,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:22,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:22,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:22,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:22,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:22,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:22,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:22,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:22,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:22,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:22,205 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:22,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:22,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:22,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:22,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:22,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:22,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:22,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:22,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:22,232 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:22,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:22,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:22,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:22,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:22,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:22,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:22,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:22,234 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:22,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:22,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:22,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:22,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:22,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:22,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:22,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:22,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:22,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:22,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:22,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:22,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:22,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:22,237 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 -> 5ef97db69fbbc2686055433c5626a55a33ea2291308e3f5a177f7b8859d14e9c [2022-02-21 03:05:22,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:22,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:22,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:22,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:22,468 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:22,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1.c [2022-02-21 03:05:22,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df89da268/96de189354b444e3933f097444cc5e15/FLAG89b4d1f1b [2022-02-21 03:05:22,859 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:22,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/GulwaniJainKoskinen-PLDI2009-Fig1.c [2022-02-21 03:05:22,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df89da268/96de189354b444e3933f097444cc5e15/FLAG89b4d1f1b [2022-02-21 03:05:23,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df89da268/96de189354b444e3933f097444cc5e15 [2022-02-21 03:05:23,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:23,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:23,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:23,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:23,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:23,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:23" (1/1) ... [2022-02-21 03:05:23,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2968de4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:23, skipping insertion in model container [2022-02-21 03:05:23,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:23" (1/1) ... [2022-02-21 03:05:23,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:23,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:23,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:23,462 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:23,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:23,484 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:23,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:23 WrapperNode [2022-02-21 03:05:23,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:23,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:23,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:23,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:23,492 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:23" (1/1) ... [2022-02-21 03:05:23,496 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:23" (1/1) ... [2022-02-21 03:05:23,520 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-02-21 03:05:23,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:23,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:23,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:23,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:23,527 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:23" (1/1) ... [2022-02-21 03:05:23,528 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:23" (1/1) ... [2022-02-21 03:05:23,529 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:23" (1/1) ... [2022-02-21 03:05:23,529 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:23" (1/1) ... [2022-02-21 03:05:23,532 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:23" (1/1) ... [2022-02-21 03:05:23,536 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:23" (1/1) ... [2022-02-21 03:05:23,539 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:23" (1/1) ... [2022-02-21 03:05:23,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:23,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:23,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:23,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:23,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:23" (1/1) ... [2022-02-21 03:05:23,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:23,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:23,570 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:23,582 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:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:23,653 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:23,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:23,788 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:23,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:23,793 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:05:23,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:23 BoogieIcfgContainer [2022-02-21 03:05:23,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:23,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:23,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:23,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:23,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:23" (1/3) ... [2022-02-21 03:05:23,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106f2b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:23, skipping insertion in model container [2022-02-21 03:05:23,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:23" (2/3) ... [2022-02-21 03:05:23,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106f2b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:23, skipping insertion in model container [2022-02-21 03:05:23,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:23" (3/3) ... [2022-02-21 03:05:23,801 INFO L111 eAbstractionObserver]: Analyzing ICFG GulwaniJainKoskinen-PLDI2009-Fig1.c [2022-02-21 03:05:23,805 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:23,805 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:05:23,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:23,838 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:23,839 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:05:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 18 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:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:05:23,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:23,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:05:23,870 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-02-21 03:05:23,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:23,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116002751] [2022-02-21 03:05:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:24,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true; {22#true} is VALID [2022-02-21 03:05:24,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#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_#t~short3#1, main_~id~0#1, main_~maxId~0#1, main_~tmp~0#1;havoc main_~id~0#1;havoc main_~maxId~0#1;havoc main_~tmp~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~id~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~maxId~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {24#(<= |ULTIMATE.start_main_~maxId~0#1| 2147483647)} is VALID [2022-02-21 03:05:24,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#(<= |ULTIMATE.start_main_~maxId~0#1| 2147483647)} assume 0 <= main_~id~0#1 && main_~id~0#1 < main_~maxId~0#1; {25#(<= |ULTIMATE.start_main_~id~0#1| 2147483646)} is VALID [2022-02-21 03:05:24,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#(<= |ULTIMATE.start_main_~id~0#1| 2147483646)} assume !(1 + main_~id~0#1 <= 2147483647); {23#false} is VALID [2022-02-21 03:05:24,025 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:24,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:24,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116002751] [2022-02-21 03:05:24,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116002751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:24,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:24,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:24,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560642011] [2022-02-21 03:05:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:05:24,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:24,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:24,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:24,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:24,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:24,070 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 18 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 has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:24,157 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-21 03:05:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:05:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-21 03:05:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-21 03:05:24,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-21 03:05:24,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:24,208 INFO L225 Difference]: With dead ends: 27 [2022-02-21 03:05:24,209 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:05:24,213 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:24,216 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:24,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 21 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:05:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:05:24,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:24,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,241 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,242 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:24,243 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:05:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:05:24,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:24,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:24,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:05:24,244 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:05:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:24,245 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:05:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:05:24,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:24,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:24,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:24,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:05:24,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 4 [2022-02-21 03:05:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:24,248 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:05:24,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:05:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:24,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:24,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:24,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:24,249 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 28693763, now seen corresponding path program 1 times [2022-02-21 03:05:24,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:24,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111684760] [2022-02-21 03:05:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:24,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#true} assume { :begin_inline_ULTIMATE.init } true; {104#true} is VALID [2022-02-21 03:05:24,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#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_#t~short3#1, main_~id~0#1, main_~maxId~0#1, main_~tmp~0#1;havoc main_~id~0#1;havoc main_~maxId~0#1;havoc main_~tmp~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~id~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~maxId~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {106#(<= 0 (+ |ULTIMATE.start_main_~id~0#1| 2147483648))} is VALID [2022-02-21 03:05:24,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#(<= 0 (+ |ULTIMATE.start_main_~id~0#1| 2147483648))} assume 0 <= main_~id~0#1 && main_~id~0#1 < main_~maxId~0#1; {106#(<= 0 (+ |ULTIMATE.start_main_~id~0#1| 2147483648))} is VALID [2022-02-21 03:05:24,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {106#(<= 0 (+ |ULTIMATE.start_main_~id~0#1| 2147483648))} assume 1 + main_~id~0#1 <= 2147483647; {106#(<= 0 (+ |ULTIMATE.start_main_~id~0#1| 2147483648))} is VALID [2022-02-21 03:05:24,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {106#(<= 0 (+ |ULTIMATE.start_main_~id~0#1| 2147483648))} assume !(1 + main_~id~0#1 >= -2147483648); {105#false} is VALID [2022-02-21 03:05:24,274 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:24,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:24,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111684760] [2022-02-21 03:05:24,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111684760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:24,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:24,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:24,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852955352] [2022-02-21 03:05:24,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:24,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:24,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,280 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:24,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:24,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:24,286 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:24,306 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:05:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:24,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 03:05:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 03:05:24,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-21 03:05:24,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:24,327 INFO L225 Difference]: With dead ends: 14 [2022-02-21 03:05:24,327 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 03:05:24,327 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:24,332 INFO L933 BasicCegarLoop]: 11 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, 12 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:24,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 12 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:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 03:05:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:05:24,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:24,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,340 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,340 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:24,345 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:05:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:05:24,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:24,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:24,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 03:05:24,347 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 03:05:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:24,348 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:05:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:05:24,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:24,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:24,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:24,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-21 03:05:24,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 5 [2022-02-21 03:05:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:24,351 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 03:05:24,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:05:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:05:24,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:24,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:24,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:24,352 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1195905587, now seen corresponding path program 1 times [2022-02-21 03:05:24,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:24,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786321505] [2022-02-21 03:05:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:24,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:05:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:24,401 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:05:24,401 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:05:24,402 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:05:24,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:05:24,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:05:24,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:05:24,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:24,407 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-21 03:05:24,410 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:24,428 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:24,428 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:24,428 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:05:24,428 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-21 03:05:24,429 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:05:24,430 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:05:24,431 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:24,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:24 BoogieIcfgContainer [2022-02-21 03:05:24,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:24,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:24,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:24,433 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:24,433 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:23" (3/4) ... [2022-02-21 03:05:24,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:05:24,473 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:24,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:24,475 INFO L158 Benchmark]: Toolchain (without parser) took 1167.78ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 58.8MB in the beginning and 109.6MB in the end (delta: -50.8MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-02-21 03:05:24,475 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:24,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.98ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 58.6MB in the beginning and 109.3MB in the end (delta: -50.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:24,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.32ms. Allocated memory is still 132.1MB. Free memory was 109.3MB in the beginning and 107.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:24,477 INFO L158 Benchmark]: Boogie Preprocessor took 22.95ms. Allocated memory is still 132.1MB. Free memory was 107.8MB in the beginning and 106.8MB in the end (delta: 973.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:24,477 INFO L158 Benchmark]: RCFGBuilder took 250.07ms. Allocated memory is still 132.1MB. Free memory was 106.8MB in the beginning and 96.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:24,478 INFO L158 Benchmark]: TraceAbstraction took 636.36ms. Allocated memory is still 132.1MB. Free memory was 95.6MB in the beginning and 54.9MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-02-21 03:05:24,478 INFO L158 Benchmark]: Witness Printer took 40.95ms. Allocated memory is still 132.1MB. Free memory was 54.5MB in the beginning and 109.6MB in the end (delta: -55.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:05:24,481 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.14ms. Allocated memory is still 94.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.98ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 58.6MB in the beginning and 109.3MB in the end (delta: -50.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.32ms. Allocated memory is still 132.1MB. Free memory was 109.3MB in the beginning and 107.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.95ms. Allocated memory is still 132.1MB. Free memory was 107.8MB in the beginning and 106.8MB in the end (delta: 973.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.07ms. Allocated memory is still 132.1MB. Free memory was 106.8MB in the beginning and 96.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 636.36ms. Allocated memory is still 132.1MB. Free memory was 95.6MB in the beginning and 54.9MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 40.95ms. Allocated memory is still 132.1MB. Free memory was 54.5MB in the beginning and 109.6MB in the end (delta: -55.1MB). Peak memory consumption was 4.2MB. 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: 25]: integer overflow possible integer overflow possible We found a FailurePath: [L16] int id, maxId, tmp; [L17] id = __VERIFIER_nondet_int() [L18] maxId = __VERIFIER_nondet_int() [L21] COND TRUE 0 <= id && id < maxId VAL [id=2147483646, maxId=2147483647] [L22] EXPR id+1 [L22] tmp = id+1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L23] tmp!=id && __VERIFIER_nondet_int() != 0 [L23] tmp!=id && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, id=2147483646, maxId=2147483647, tmp=2147483647, tmp!=id && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE tmp!=id && __VERIFIER_nondet_int() != 0 [L24] COND TRUE tmp <= maxId VAL [id=2147483646, maxId=2147483647, tmp=2147483647] [L25] tmp + 1 VAL [id=2147483646, maxId=2147483647, tmp=2147483647] - UnprovableResult [Line: 22]: 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. - UnprovableResult [Line: 25]: 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, 19 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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:24,517 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)