./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_b3_o2-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/recursive-simple/id_b3_o2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 3bf945356a28265a842df89cdbf40bfa9a223140 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:24:26,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:24:26,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:24:26,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:24:26,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:24:26,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:24:26,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:24:26,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:24:26,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:24:26,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:24:26,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:24:26,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:24:26,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:24:26,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:24:26,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:24:26,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:24:26,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:24:26,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:24:26,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:24:26,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:24:26,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:24:26,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:24:26,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:24:26,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:24:26,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:24:26,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:24:26,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:24:26,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:24:26,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:24:26,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:24:26,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:24:26,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:24:26,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:24:26,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:24:26,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:24:26,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:24:26,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:24:26,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:24:26,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:24:26,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:24:26,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:24:26,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2020-07-29 01:24:26,328 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:24:26,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:24:26,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:24:26,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:24:26,331 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:24:26,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:24:26,332 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:24:26,332 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:24:26,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:24:26,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:24:26,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:24:26,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-29 01:24:26,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:24:26,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-29 01:24:26,334 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-07-29 01:24:26,334 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:24:26,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:24:26,335 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:24:26,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-29 01:24:26,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:24:26,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:24:26,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:24:26,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:24:26,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:24:26,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:24:26,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:24:26,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-29 01:24:26,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:24:26,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:24:26,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-29 01:24:26,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:24:26,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bf945356a28265a842df89cdbf40bfa9a223140 [2020-07-29 01:24:26,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:24:26,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:24:26,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:24:26,684 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:24:26,686 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:24:26,687 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_b3_o2-2.c [2020-07-29 01:24:26,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8b939d2/6cefd284b8e5491a9beab00438e63cae/FLAG9e45809e1 [2020-07-29 01:24:27,241 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:24:27,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_b3_o2-2.c [2020-07-29 01:24:27,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8b939d2/6cefd284b8e5491a9beab00438e63cae/FLAG9e45809e1 [2020-07-29 01:24:27,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8b939d2/6cefd284b8e5491a9beab00438e63cae [2020-07-29 01:24:27,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:24:27,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:24:27,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:24:27,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:24:27,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:24:27,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:27,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abfc1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27, skipping insertion in model container [2020-07-29 01:24:27,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:27,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:24:27,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:24:27,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:24:27,931 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:24:27,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:24:27,963 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:24:27,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27 WrapperNode [2020-07-29 01:24:27,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:24:27,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:24:27,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:24:27,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:24:27,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:27,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:24:28,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:24:28,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:24:28,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:24:28,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... [2020-07-29 01:24:28,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:24:28,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:24:28,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:24:28,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:24:28,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:24:28,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:24:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:24:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-29 01:24:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-29 01:24:28,395 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:24:28,396 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:24:28,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:24:28 BoogieIcfgContainer [2020-07-29 01:24:28,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:24:28,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:24:28,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:24:28,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:24:28,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:24:27" (1/3) ... [2020-07-29 01:24:28,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413e926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:24:28, skipping insertion in model container [2020-07-29 01:24:28,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:27" (2/3) ... [2020-07-29 01:24:28,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413e926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:24:28, skipping insertion in model container [2020-07-29 01:24:28,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:24:28" (3/3) ... [2020-07-29 01:24:28,410 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o2-2.c [2020-07-29 01:24:28,426 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:24:28,438 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-29 01:24:28,457 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-29 01:24:28,488 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:24:28,488 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-29 01:24:28,489 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:24:28,489 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:24:28,489 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:24:28,489 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:24:28,489 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:24:28,490 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:24:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-29 01:24:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:24:28,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:28,521 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:28,522 INFO L427 AbstractCegarLoop]: === Iteration 1 === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1550668038, now seen corresponding path program 1 times [2020-07-29 01:24:28,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:28,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66801887] [2020-07-29 01:24:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:28,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:24:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:28,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} ~x := #in~x; {22#true} is VALID [2020-07-29 01:24:28,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume 0 == ~x;#res := 0; {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:28,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:28,875 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {22#true} #33#return; {28#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:28,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {22#true} is VALID [2020-07-29 01:24:28,878 INFO L263 TraceCheckUtils]: 1: Hoare triple {22#true} call main_#t~ret2 := id(main_~input~0); {22#true} is VALID [2020-07-29 01:24:28,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} ~x := #in~x; {22#true} is VALID [2020-07-29 01:24:28,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {22#true} assume !(0 == ~x); {22#true} is VALID [2020-07-29 01:24:28,879 INFO L263 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {22#true} is VALID [2020-07-29 01:24:28,879 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} ~x := #in~x; {22#true} is VALID [2020-07-29 01:24:28,880 INFO L280 TraceCheckUtils]: 6: Hoare triple {22#true} assume 0 == ~x;#res := 0; {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:28,882 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:28,884 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {29#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {22#true} #33#return; {28#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:28,885 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {28#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:28,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#(= 0 |id_#t~ret0|)} assume !(1 + #t~ret0 <= 2147483647); {23#false} is VALID [2020-07-29 01:24:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:24:28,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66801887] [2020-07-29 01:24:28,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:24:28,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:24:28,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557308905] [2020-07-29 01:24:28,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:24:28,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:28,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:24:28,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:28,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:24:28,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:28,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:24:28,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:24:28,947 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2020-07-29 01:24:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:29,124 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:24:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:24:29,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:24:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:24:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 01:24:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:24:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 01:24:29,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2020-07-29 01:24:29,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:29,234 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:24:29,234 INFO L226 Difference]: Without dead ends: 18 [2020-07-29 01:24:29,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:24:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-29 01:24:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:24:29,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:29,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-29 01:24:29,274 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-29 01:24:29,274 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-29 01:24:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:29,278 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-29 01:24:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:24:29,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:29,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:29,280 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-29 01:24:29,280 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-29 01:24:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:29,283 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-29 01:24:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:24:29,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:29,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:29,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:29,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:24:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-29 01:24:29,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2020-07-29 01:24:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:29,289 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:24:29,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:24:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:24:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:24:29,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:29,291 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:29,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:24:29,292 INFO L427 AbstractCegarLoop]: === Iteration 2 === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 876403791, now seen corresponding path program 1 times [2020-07-29 01:24:29,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:29,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453885284] [2020-07-29 01:24:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:29,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:24:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:29,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:24:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:29,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} ~x := #in~x; {121#true} is VALID [2020-07-29 01:24:29,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume 0 == ~x;#res := 0; {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,494 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {121#true} #33#return; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} ~x := #in~x; {121#true} is VALID [2020-07-29 01:24:29,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume !(0 == ~x); {121#true} is VALID [2020-07-29 01:24:29,495 INFO L263 TraceCheckUtils]: 2: Hoare triple {121#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {121#true} is VALID [2020-07-29 01:24:29,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {121#true} ~x := #in~x; {121#true} is VALID [2020-07-29 01:24:29,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} assume 0 == ~x;#res := 0; {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,501 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {121#true} #33#return; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {140#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {140#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {140#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {141#(<= id_~ret~0 1)} is VALID [2020-07-29 01:24:29,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {122#false} is VALID [2020-07-29 01:24:29,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#false} assume true; {122#false} is VALID [2020-07-29 01:24:29,506 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {122#false} {121#true} #33#return; {122#false} is VALID [2020-07-29 01:24:29,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {121#true} is VALID [2020-07-29 01:24:29,508 INFO L263 TraceCheckUtils]: 1: Hoare triple {121#true} call main_#t~ret2 := id(main_~input~0); {121#true} is VALID [2020-07-29 01:24:29,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {121#true} ~x := #in~x; {121#true} is VALID [2020-07-29 01:24:29,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {121#true} assume !(0 == ~x); {121#true} is VALID [2020-07-29 01:24:29,509 INFO L263 TraceCheckUtils]: 4: Hoare triple {121#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {121#true} is VALID [2020-07-29 01:24:29,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {121#true} ~x := #in~x; {121#true} is VALID [2020-07-29 01:24:29,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {121#true} assume !(0 == ~x); {121#true} is VALID [2020-07-29 01:24:29,511 INFO L263 TraceCheckUtils]: 7: Hoare triple {121#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {121#true} is VALID [2020-07-29 01:24:29,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {121#true} ~x := #in~x; {121#true} is VALID [2020-07-29 01:24:29,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {121#true} assume 0 == ~x;#res := 0; {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,517 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {142#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {121#true} #33#return; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,518 INFO L280 TraceCheckUtils]: 12: Hoare triple {140#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,519 INFO L280 TraceCheckUtils]: 13: Hoare triple {140#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {140#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {140#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {141#(<= id_~ret~0 1)} is VALID [2020-07-29 01:24:29,521 INFO L280 TraceCheckUtils]: 15: Hoare triple {141#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {122#false} is VALID [2020-07-29 01:24:29,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {122#false} assume true; {122#false} is VALID [2020-07-29 01:24:29,522 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {122#false} {121#true} #33#return; {122#false} is VALID [2020-07-29 01:24:29,522 INFO L280 TraceCheckUtils]: 18: Hoare triple {122#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {122#false} is VALID [2020-07-29 01:24:29,523 INFO L280 TraceCheckUtils]: 19: Hoare triple {122#false} assume !(1 + #t~ret0 <= 2147483647); {122#false} is VALID [2020-07-29 01:24:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:24:29,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453885284] [2020-07-29 01:24:29,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:24:29,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:24:29,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622136032] [2020-07-29 01:24:29,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:24:29,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:29,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:24:29,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:24:29,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:24:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:24:29,559 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2020-07-29 01:24:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:29,671 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-29 01:24:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:24:29,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:24:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:24:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:24:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:24:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:24:29,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-29 01:24:29,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:29,732 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:24:29,732 INFO L226 Difference]: Without dead ends: 21 [2020-07-29 01:24:29,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:24:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-29 01:24:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:24:29,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:29,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2020-07-29 01:24:29,741 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2020-07-29 01:24:29,741 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2020-07-29 01:24:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:29,744 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:24:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:24:29,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:29,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:29,746 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2020-07-29 01:24:29,746 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2020-07-29 01:24:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:29,749 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:24:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:24:29,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:29,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:29,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:29,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:24:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-29 01:24:29,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 20 [2020-07-29 01:24:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:29,754 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-29 01:24:29,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:24:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:24:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:24:29,755 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:29,755 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:29,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:24:29,756 INFO L427 AbstractCegarLoop]: === Iteration 3 === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash 877327312, now seen corresponding path program 1 times [2020-07-29 01:24:29,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:29,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508109414] [2020-07-29 01:24:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:29,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:24:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:29,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:24:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:29,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:29,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#true} assume 0 == ~x;#res := 0; {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,952 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {241#true} #33#return; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:29,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#true} assume !(0 == ~x); {241#true} is VALID [2020-07-29 01:24:29,954 INFO L263 TraceCheckUtils]: 2: Hoare triple {241#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {241#true} is VALID [2020-07-29 01:24:29,955 INFO L280 TraceCheckUtils]: 3: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:29,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {241#true} assume 0 == ~x;#res := 0; {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,960 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {241#true} #33#return; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {261#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {261#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,964 INFO L280 TraceCheckUtils]: 9: Hoare triple {261#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {262#(<= id_~ret~0 1)} is VALID [2020-07-29 01:24:29,965 INFO L280 TraceCheckUtils]: 10: Hoare triple {262#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {263#(<= |id_#res| 1)} is VALID [2020-07-29 01:24:29,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {263#(<= |id_#res| 1)} assume true; {263#(<= |id_#res| 1)} is VALID [2020-07-29 01:24:29,968 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {263#(<= |id_#res| 1)} {241#true} #33#return; {256#(<= |id_#t~ret0| 1)} is VALID [2020-07-29 01:24:29,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {241#true} is VALID [2020-07-29 01:24:29,970 INFO L263 TraceCheckUtils]: 1: Hoare triple {241#true} call main_#t~ret2 := id(main_~input~0); {241#true} is VALID [2020-07-29 01:24:29,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:29,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {241#true} assume !(0 == ~x); {241#true} is VALID [2020-07-29 01:24:29,971 INFO L263 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {241#true} is VALID [2020-07-29 01:24:29,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:29,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {241#true} assume !(0 == ~x); {241#true} is VALID [2020-07-29 01:24:29,972 INFO L263 TraceCheckUtils]: 7: Hoare triple {241#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {241#true} is VALID [2020-07-29 01:24:29,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:29,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {241#true} assume 0 == ~x;#res := 0; {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-29 01:24:29,978 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {264#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {241#true} #33#return; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {261#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,980 INFO L280 TraceCheckUtils]: 13: Hoare triple {261#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {261#(= 0 |id_#t~ret0|)} is VALID [2020-07-29 01:24:29,982 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#(= 0 |id_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {262#(<= id_~ret~0 1)} is VALID [2020-07-29 01:24:29,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {263#(<= |id_#res| 1)} is VALID [2020-07-29 01:24:29,984 INFO L280 TraceCheckUtils]: 16: Hoare triple {263#(<= |id_#res| 1)} assume true; {263#(<= |id_#res| 1)} is VALID [2020-07-29 01:24:29,986 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {263#(<= |id_#res| 1)} {241#true} #33#return; {256#(<= |id_#t~ret0| 1)} is VALID [2020-07-29 01:24:29,987 INFO L280 TraceCheckUtils]: 18: Hoare triple {256#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {256#(<= |id_#t~ret0| 1)} is VALID [2020-07-29 01:24:29,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {256#(<= |id_#t~ret0| 1)} assume !(1 + #t~ret0 <= 2147483647); {242#false} is VALID [2020-07-29 01:24:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:24:29,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508109414] [2020-07-29 01:24:29,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016321740] [2020-07-29 01:24:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:24:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:30,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:24:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:30,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:24:30,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {241#true} is VALID [2020-07-29 01:24:30,256 INFO L263 TraceCheckUtils]: 1: Hoare triple {241#true} call main_#t~ret2 := id(main_~input~0); {241#true} is VALID [2020-07-29 01:24:30,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:30,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {241#true} assume !(0 == ~x); {241#true} is VALID [2020-07-29 01:24:30,257 INFO L263 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {241#true} is VALID [2020-07-29 01:24:30,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:30,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {241#true} assume !(0 == ~x); {241#true} is VALID [2020-07-29 01:24:30,258 INFO L263 TraceCheckUtils]: 7: Hoare triple {241#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {241#true} is VALID [2020-07-29 01:24:30,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {241#true} ~x := #in~x; {241#true} is VALID [2020-07-29 01:24:30,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {241#true} assume 0 == ~x;#res := 0; {295#(<= |id_#res| 0)} is VALID [2020-07-29 01:24:30,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {295#(<= |id_#res| 0)} assume true; {295#(<= |id_#res| 0)} is VALID [2020-07-29 01:24:30,263 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {295#(<= |id_#res| 0)} {241#true} #33#return; {302#(<= |id_#t~ret0| 0)} is VALID [2020-07-29 01:24:30,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {302#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {302#(<= |id_#t~ret0| 0)} is VALID [2020-07-29 01:24:30,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(<= |id_#t~ret0| 0)} assume 1 + #t~ret0 <= 2147483647; {302#(<= |id_#t~ret0| 0)} is VALID [2020-07-29 01:24:30,267 INFO L280 TraceCheckUtils]: 14: Hoare triple {302#(<= |id_#t~ret0| 0)} assume 1 + #t~ret0 >= -2147483648;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {262#(<= id_~ret~0 1)} is VALID [2020-07-29 01:24:30,268 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {263#(<= |id_#res| 1)} is VALID [2020-07-29 01:24:30,269 INFO L280 TraceCheckUtils]: 16: Hoare triple {263#(<= |id_#res| 1)} assume true; {263#(<= |id_#res| 1)} is VALID [2020-07-29 01:24:30,271 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {263#(<= |id_#res| 1)} {241#true} #33#return; {256#(<= |id_#t~ret0| 1)} is VALID [2020-07-29 01:24:30,272 INFO L280 TraceCheckUtils]: 18: Hoare triple {256#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {256#(<= |id_#t~ret0| 1)} is VALID [2020-07-29 01:24:30,274 INFO L280 TraceCheckUtils]: 19: Hoare triple {256#(<= |id_#t~ret0| 1)} assume !(1 + #t~ret0 <= 2147483647); {242#false} is VALID [2020-07-29 01:24:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:24:30,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:24:30,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-29 01:24:30,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512151246] [2020-07-29 01:24:30,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:24:30,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:30,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:24:30,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:30,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:24:30,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:24:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:24:30,313 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 9 states. [2020-07-29 01:24:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:30,453 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-29 01:24:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:24:30,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:24:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:24:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-29 01:24:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:24:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-29 01:24:30,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2020-07-29 01:24:30,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:30,504 INFO L225 Difference]: With dead ends: 25 [2020-07-29 01:24:30,504 INFO L226 Difference]: Without dead ends: 24 [2020-07-29 01:24:30,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:24:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-29 01:24:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-29 01:24:30,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:30,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-29 01:24:30,511 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-29 01:24:30,511 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-29 01:24:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:30,514 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-29 01:24:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:24:30,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:30,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:30,515 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-29 01:24:30,516 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-29 01:24:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:30,518 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-29 01:24:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:24:30,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:30,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:30,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:30,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:24:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-29 01:24:30,523 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-29 01:24:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:30,523 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-29 01:24:30,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:24:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-29 01:24:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:24:30,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:30,525 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:30,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:24:30,740 INFO L427 AbstractCegarLoop]: === Iteration 4 === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1427342950, now seen corresponding path program 1 times [2020-07-29 01:24:30,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:30,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943398708] [2020-07-29 01:24:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:30,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:24:30,760 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:24:30,772 INFO L168 Benchmark]: Toolchain (without parser) took 3108.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 960.2 MB in the beginning and 926.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:30,773 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:24:30,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.15 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:30,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:30,776 INFO L168 Benchmark]: Boogie Preprocessor took 18.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:30,777 INFO L168 Benchmark]: RCFGBuilder took 321.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:30,778 INFO L168 Benchmark]: TraceAbstraction took 2363.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 926.3 MB in the end (delta: 184.8 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:30,787 INFO L336 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.15 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 321.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2363.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 926.3 MB in the end (delta: 184.8 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...