./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.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 554582d6fc3de8e87f5dd30e5019302b6e1b96be .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:53:10,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:53:10,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:53:10,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:53:10,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:53:10,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:53:10,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:53:10,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:53:10,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:53:10,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:53:10,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:53:10,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:53:10,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:53:10,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:53:10,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:53:10,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:53:10,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:53:10,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:53:10,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:53:10,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:53:10,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:53:10,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:53:10,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:53:10,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:53:10,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:53:10,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:53:10,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:53:10,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:53:10,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:53:10,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:53:10,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:53:10,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:53:10,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:53:10,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:53:10,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:53:10,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:53:10,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:53:10,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:53:10,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:53:10,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:53:10,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:53:10,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-19 19:53:10,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:53:10,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:53:10,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:53:10,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:53:10,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:53:10,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:53:10,438 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:53:10,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:53:10,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:53:10,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 19:53:10,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:53:10,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 19:53:10,440 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 19:53:10,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:53:10,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:53:10,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 19:53:10,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:53:10,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:53:10,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:53:10,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:53:10,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:53:10,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:53:10,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:53:10,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 19:53:10,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:53:10,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 19:53:10,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 19:53:10,445 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 554582d6fc3de8e87f5dd30e5019302b6e1b96be [2019-11-19 19:53:10,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:53:10,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:53:10,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:53:10,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:53:10,817 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:53:10,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.c [2019-11-19 19:53:10,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92d0a511/13948f0f04c74765b1f2444508c9ccbd/FLAG52804923c [2019-11-19 19:53:11,261 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:53:11,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.c [2019-11-19 19:53:11,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92d0a511/13948f0f04c74765b1f2444508c9ccbd/FLAG52804923c [2019-11-19 19:53:11,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92d0a511/13948f0f04c74765b1f2444508c9ccbd [2019-11-19 19:53:11,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:53:11,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:53:11,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:11,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:53:11,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:53:11,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:11,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e35156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11, skipping insertion in model container [2019-11-19 19:53:11,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:11,720 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:53:11,738 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:53:11,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:11,959 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:53:11,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:11,997 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:53:11,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11 WrapperNode [2019-11-19 19:53:11,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:11,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:12,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:53:12,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:53:12,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:12,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:53:12,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:53:12,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:53:12,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (1/1) ... [2019-11-19 19:53:12,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:53:12,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:53:12,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:53:12,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:53:12,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (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 [2019-11-19 19:53:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure p [2019-11-19 19:53:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure p [2019-11-19 19:53:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:53:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:53:12,438 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:53:12,439 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 19:53:12,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:12 BoogieIcfgContainer [2019-11-19 19:53:12,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:53:12,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:53:12,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:53:12,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:53:12,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:11" (1/3) ... [2019-11-19 19:53:12,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfa002a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:12, skipping insertion in model container [2019-11-19 19:53:12,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:11" (2/3) ... [2019-11-19 19:53:12,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfa002a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:12, skipping insertion in model container [2019-11-19 19:53:12,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:12" (3/3) ... [2019-11-19 19:53:12,465 INFO L109 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex4.c [2019-11-19 19:53:12,476 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:53:12,485 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-19 19:53:12,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-19 19:53:12,538 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:53:12,538 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 19:53:12,538 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:53:12,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:53:12,538 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:53:12,539 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:53:12,539 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:53:12,539 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:53:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-19 19:53:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 19:53:12,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:12,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:53:12,562 INFO L410 AbstractCegarLoop]: === Iteration 1 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1571177437, now seen corresponding path program 1 times [2019-11-19 19:53:12,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:12,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429870502] [2019-11-19 19:53:12,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:12,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429870502] [2019-11-19 19:53:12,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:12,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:53:12,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656082383] [2019-11-19 19:53:12,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:53:12,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:53:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:53:12,799 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2019-11-19 19:53:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:12,948 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-11-19 19:53:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:53:12,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-19 19:53:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:12,957 INFO L225 Difference]: With dead ends: 44 [2019-11-19 19:53:12,957 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 19:53:12,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:53:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 19:53:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-11-19 19:53:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 19:53:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-19 19:53:12,993 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 6 [2019-11-19 19:53:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:12,994 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-19 19:53:12,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:53:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-19 19:53:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-19 19:53:12,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:12,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:12,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1461860328, now seen corresponding path program 1 times [2019-11-19 19:53:12,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:12,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327508557] [2019-11-19 19:53:12,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327508557] [2019-11-19 19:53:13,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:13,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:13,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492741218] [2019-11-19 19:53:13,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:13,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:13,030 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-11-19 19:53:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:13,048 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-11-19 19:53:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:13,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-19 19:53:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:13,049 INFO L225 Difference]: With dead ends: 19 [2019-11-19 19:53:13,050 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 19:53:13,051 INFO L630 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 [2019-11-19 19:53:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 19:53:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-19 19:53:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-19 19:53:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-19 19:53:13,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 7 [2019-11-19 19:53:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:13,057 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-19 19:53:13,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-11-19 19:53:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-19 19:53:13,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:13,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:13,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1461867311, now seen corresponding path program 1 times [2019-11-19 19:53:13,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:13,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698631891] [2019-11-19 19:53:13,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698631891] [2019-11-19 19:53:13,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:13,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:53:13,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118982725] [2019-11-19 19:53:13,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:53:13,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:53:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:53:13,112 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2019-11-19 19:53:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:13,185 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-11-19 19:53:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:53:13,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-19 19:53:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:13,187 INFO L225 Difference]: With dead ends: 30 [2019-11-19 19:53:13,187 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 19:53:13,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:53:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 19:53:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-19 19:53:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-19 19:53:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-19 19:53:13,196 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2019-11-19 19:53:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:13,196 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-19 19:53:13,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:53:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-19 19:53:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 19:53:13,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:13,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:13,198 INFO L410 AbstractCegarLoop]: === Iteration 4 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1926753568, now seen corresponding path program 1 times [2019-11-19 19:53:13,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:13,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32031149] [2019-11-19 19:53:13,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32031149] [2019-11-19 19:53:13,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:13,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:13,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682171586] [2019-11-19 19:53:13,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:13,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:13,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:13,244 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2019-11-19 19:53:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:13,263 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-11-19 19:53:13,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:13,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-19 19:53:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:13,265 INFO L225 Difference]: With dead ends: 24 [2019-11-19 19:53:13,265 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 19:53:13,265 INFO L630 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 [2019-11-19 19:53:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 19:53:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-19 19:53:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 19:53:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-19 19:53:13,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2019-11-19 19:53:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:13,272 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-19 19:53:13,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-19 19:53:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 19:53:13,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:13,273 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:13,273 INFO L410 AbstractCegarLoop]: === Iteration 5 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:13,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash 168982822, now seen corresponding path program 1 times [2019-11-19 19:53:13,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:13,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153791794] [2019-11-19 19:53:13,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153791794] [2019-11-19 19:53:13,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258510775] [2019-11-19 19:53:13,348 INFO L94 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 [2019-11-19 19:53:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:53:13,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:13,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-19 19:53:13,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342713380] [2019-11-19 19:53:13,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:53:13,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:53:13,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:13,456 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-11-19 19:53:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:13,580 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-19 19:53:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:53:13,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-19 19:53:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:13,581 INFO L225 Difference]: With dead ends: 45 [2019-11-19 19:53:13,582 INFO L226 Difference]: Without dead ends: 43 [2019-11-19 19:53:13,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:53:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-19 19:53:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-19 19:53:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 19:53:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-19 19:53:13,591 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 11 [2019-11-19 19:53:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:13,592 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-19 19:53:13,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:53:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-19 19:53:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 19:53:13,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:13,593 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:13,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:13,797 INFO L410 AbstractCegarLoop]: === Iteration 6 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 943507206, now seen corresponding path program 1 times [2019-11-19 19:53:13,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:13,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468663416] [2019-11-19 19:53:13,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468663416] [2019-11-19 19:53:13,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879504327] [2019-11-19 19:53:13,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:13,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:53:13,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:13,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:13,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-19 19:53:13,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908627744] [2019-11-19 19:53:13,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:53:13,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:53:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:13,975 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 7 states. [2019-11-19 19:53:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:14,101 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-19 19:53:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:53:14,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-19 19:53:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:14,107 INFO L225 Difference]: With dead ends: 67 [2019-11-19 19:53:14,108 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 19:53:14,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:53:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 19:53:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 33. [2019-11-19 19:53:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 19:53:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-19 19:53:14,118 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 12 [2019-11-19 19:53:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:14,118 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-19 19:53:14,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:53:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-19 19:53:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 19:53:14,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:14,119 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:14,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1019019044, now seen corresponding path program 1 times [2019-11-19 19:53:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:14,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953486222] [2019-11-19 19:53:14,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:14,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953486222] [2019-11-19 19:53:14,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169468003] [2019-11-19 19:53:14,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:14,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:53:14,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:14,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:14,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-19 19:53:14,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449836313] [2019-11-19 19:53:14,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:53:14,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:53:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:14,446 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2019-11-19 19:53:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:14,563 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-11-19 19:53:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:53:14,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-19 19:53:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:14,565 INFO L225 Difference]: With dead ends: 53 [2019-11-19 19:53:14,565 INFO L226 Difference]: Without dead ends: 52 [2019-11-19 19:53:14,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-19 19:53:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-19 19:53:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2019-11-19 19:53:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 19:53:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-11-19 19:53:14,575 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 12 [2019-11-19 19:53:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:14,576 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-19 19:53:14,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:53:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-11-19 19:53:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 19:53:14,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:14,578 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:14,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,782 INFO L410 AbstractCegarLoop]: === Iteration 8 === [pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 19:53:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1112438587, now seen corresponding path program 1 times [2019-11-19 19:53:14,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:14,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995763704] [2019-11-19 19:53:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:14,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995763704] [2019-11-19 19:53:14,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622991386] [2019-11-19 19:53:14,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:14,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 19:53:14,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:14,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:14,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-19 19:53:14,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914851932] [2019-11-19 19:53:14,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:53:14,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:14,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:53:14,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:14,918 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 9 states. [2019-11-19 19:53:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:15,154 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-11-19 19:53:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 19:53:15,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-19 19:53:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:15,155 INFO L225 Difference]: With dead ends: 47 [2019-11-19 19:53:15,155 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 19:53:15,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-19 19:53:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 19:53:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 19:53:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 19:53:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 19:53:15,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-19 19:53:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:15,158 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:53:15,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:53:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 19:53:15,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 19:53:15,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:15,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 19:53:15,689 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2019-11-19 19:53:15,780 INFO L444 ceAbstractionStarter]: For program point pEXIT(lines 12 22) no Hoare annotation was computed. [2019-11-19 19:53:15,780 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-19 19:53:15,781 INFO L444 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-11-19 19:53:15,781 INFO L444 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-11-19 19:53:15,781 INFO L447 ceAbstractionStarter]: At program point pENTRY(lines 12 22) the Hoare annotation is: true [2019-11-19 19:53:15,781 INFO L440 ceAbstractionStarter]: At program point L17-2(line 17) the Hoare annotation is: (let ((.cse0 (not (<= |p_#in~m| 2147483647))) (.cse1 (not (<= |p_#in~r| 2147483647)))) (and (or (not (<= |p_#in~n| 2147483647)) .cse0 (and (and (<= p_~n 2147483647) (<= 1 p_~n)) (<= p_~m 2147483647) (<= p_~r 2147483647)) .cse1) (or (not (<= |p_#in~n| 2147483646)) .cse0 (<= p_~n 2147483646) .cse1))) [2019-11-19 19:53:15,781 INFO L444 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-19 19:53:15,781 INFO L444 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. [2019-11-19 19:53:15,782 INFO L444 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. [2019-11-19 19:53:15,782 INFO L444 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-19 19:53:15,782 INFO L444 ceAbstractionStarter]: For program point pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-19 19:53:15,782 INFO L440 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |p_#in~m| 2147483647))) (.cse1 (not (<= |p_#in~r| 2147483647)))) (and (or (not (<= |p_#in~n| 2147483647)) .cse0 (and (<= p_~m 2147483647) (<= p_~r 2147483647) (and (<= p_~n 2147483647) (<= 1 p_~r))) .cse1) (or (<= p_~n 2147483646) (not (<= |p_#in~n| 2147483646)) .cse0 .cse1))) [2019-11-19 19:53:15,782 INFO L444 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-19 19:53:15,782 INFO L444 ceAbstractionStarter]: For program point pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-19 19:53:15,783 INFO L444 ceAbstractionStarter]: For program point pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 19:53:15,783 INFO L444 ceAbstractionStarter]: For program point pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 19:53:15,783 INFO L444 ceAbstractionStarter]: For program point pFINAL(lines 12 22) no Hoare annotation was computed. [2019-11-19 19:53:15,783 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 19:53:15,783 INFO L440 ceAbstractionStarter]: At program point L31(lines 24 32) the Hoare annotation is: (<= ULTIMATE.start_main_~r~0 2147483647) [2019-11-19 19:53:15,783 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 19:53:15,783 INFO L440 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= ULTIMATE.start_main_~m~0 2147483647) (<= ULTIMATE.start_main_~r~0 2147483647)) [2019-11-19 19:53:15,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 19:53:15,784 INFO L444 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2019-11-19 19:53:15,784 INFO L444 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-19 19:53:15,784 INFO L444 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-19 19:53:15,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:53:15 BoogieIcfgContainer [2019-11-19 19:53:15,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:53:15,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:53:15,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:53:15,799 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:53:15,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:12" (3/4) ... [2019-11-19 19:53:15,804 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 19:53:15,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure p [2019-11-19 19:53:15,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 19:53:15,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 19:53:15,864 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 19:53:15,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:53:15,867 INFO L168 Benchmark]: Toolchain (without parser) took 4166.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 961.7 MB in the beginning and 790.0 MB in the end (delta: 171.7 MB). Peak memory consumption was 243.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:15,867 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:15,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:15,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:15,870 INFO L168 Benchmark]: Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:15,871 INFO L168 Benchmark]: RCFGBuilder took 317.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:15,871 INFO L168 Benchmark]: TraceAbstraction took 3356.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 790.0 MB in the end (delta: 250.3 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:15,872 INFO L168 Benchmark]: Witness Printer took 65.76 ms. Allocated memory is still 1.1 GB. Free memory is still 790.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:15,877 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3356.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 790.0 MB in the end (delta: 250.3 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. * Witness Printer took 65.76 ms. Allocated memory is still 1.1 GB. Free memory is still 790.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: r <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. Result: SAFE, OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 133 SDtfs, 199 SDslu, 230 SDs, 0 SdLazy, 349 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=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, 8 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 29 PreInvPairs, 29 NumberOfFragments, 102 HoareAnnotationTreeSize, 29 FomulaSimplifications, 2073 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 269 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 4106 SizeOfPredicates, 9 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...