./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MenloPark.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c 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/MenloPark.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 7c87c9e4b733dad657e6ff9e27a5e9b26a2c3764 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:22:31,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:22:31,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:22:31,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:22:31,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:22:31,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:22:31,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:22:31,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:22:31,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:22:31,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:22:31,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:22:31,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:22:31,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:22:31,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:22:31,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:22:31,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:22:31,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:22:31,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:22:31,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:22:31,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:22:31,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:22:31,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:22:31,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:22:31,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:22:31,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:22:31,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:22:31,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:22:31,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:22:31,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:22:31,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:22:31,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:22:31,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:22:31,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:22:31,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:22:31,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:22:31,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:22:31,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:22:31,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:22:31,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:22:31,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:22:31,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:22:31,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:22:31,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:22:31,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:22:31,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:22:31,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:22:31,506 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:22:31,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:22:31,506 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:22:31,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:22:31,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:22:31,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:22:31,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:22:31,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:22:31,508 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:22:31,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:22:31,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:22:31,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:22:31,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:22:31,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:22:31,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:22:31,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:22:31,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:31,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:22:31,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:22:31,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:22:31,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:22:31,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:22:31,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:22:31,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:22:31,513 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 -> 7c87c9e4b733dad657e6ff9e27a5e9b26a2c3764 [2019-11-28 20:22:31,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:22:31,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:22:31,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:22:31,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:22:31,813 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:22:31,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MenloPark.c [2019-11-28 20:22:31,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beead76d9/0166269bffae42818d2699bcfe4e7b44/FLAG3b803c7f8 [2019-11-28 20:22:32,332 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:22:32,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MenloPark.c [2019-11-28 20:22:32,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beead76d9/0166269bffae42818d2699bcfe4e7b44/FLAG3b803c7f8 [2019-11-28 20:22:32,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beead76d9/0166269bffae42818d2699bcfe4e7b44 [2019-11-28 20:22:32,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:22:32,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:22:32,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:32,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:22:32,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:22:32,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:32,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14911ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32, skipping insertion in model container [2019-11-28 20:22:32,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:32,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:22:32,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:22:32,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:32,910 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:22:32,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:32,944 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:22:32,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32 WrapperNode [2019-11-28 20:22:32,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:32,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:32,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:22:32,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:22:32,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:32,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:33,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:22:33,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:22:33,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:22:33,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (1/1) ... [2019-11-28 20:22:33,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:22:33,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:22:33,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:22:33,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:22:33,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (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-28 20:22:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:22:33,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:22:33,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:22:33,276 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:22:33,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:33 BoogieIcfgContainer [2019-11-28 20:22:33,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:22:33,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:22:33,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:22:33,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:22:33,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:32" (1/3) ... [2019-11-28 20:22:33,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b80bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:33, skipping insertion in model container [2019-11-28 20:22:33,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:32" (2/3) ... [2019-11-28 20:22:33,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b80bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:33, skipping insertion in model container [2019-11-28 20:22:33,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:33" (3/3) ... [2019-11-28 20:22:33,286 INFO L109 eAbstractionObserver]: Analyzing ICFG MenloPark.c [2019-11-28 20:22:33,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:22:33,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 20:22:33,316 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 20:22:33,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:22:33,348 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:22:33,348 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:22:33,349 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:22:33,349 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:22:33,349 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:22:33,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:22:33,350 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:22:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 20:22:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 20:22:33,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:33,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 20:22:33,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-11-28 20:22:33,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:33,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885609782] [2019-11-28 20:22:33,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:33,565 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-28 20:22:33,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885609782] [2019-11-28 20:22:33,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:33,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:22:33,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507125301] [2019-11-28 20:22:33,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:33,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:33,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:33,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:33,584 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-28 20:22:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:33,652 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 20:22:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:33,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 20:22:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:33,662 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:22:33,662 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 20:22:33,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-28 20:22:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 20:22:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 20:22:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:22:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-28 20:22:33,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2019-11-28 20:22:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:33,696 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-28 20:22:33,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-28 20:22:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 20:22:33,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:33,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 20:22:33,698 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-11-28 20:22:33,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:33,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114860505] [2019-11-28 20:22:33,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:33,732 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-28 20:22:33,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114860505] [2019-11-28 20:22:33,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:33,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:33,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313371252] [2019-11-28 20:22:33,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:33,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:33,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:33,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:33,736 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2019-11-28 20:22:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:33,818 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 20:22:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:22:33,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-28 20:22:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:33,819 INFO L225 Difference]: With dead ends: 22 [2019-11-28 20:22:33,819 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 20:22:33,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 20:22:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-28 20:22:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:22:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-28 20:22:33,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2019-11-28 20:22:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:33,829 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-28 20:22:33,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-28 20:22:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:22:33,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:33,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:22:33,832 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash 29862563, now seen corresponding path program 1 times [2019-11-28 20:22:33,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:33,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852729739] [2019-11-28 20:22:33,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:33,891 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-28 20:22:33,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852729739] [2019-11-28 20:22:33,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:33,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:22:33,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575077739] [2019-11-28 20:22:33,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:33,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:33,894 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-11-28 20:22:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:33,926 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-11-28 20:22:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:33,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 20:22:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:33,928 INFO L225 Difference]: With dead ends: 20 [2019-11-28 20:22:33,928 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 20:22:33,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-28 20:22:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 20:22:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 20:22:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:22:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-28 20:22:33,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2019-11-28 20:22:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:33,935 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-28 20:22:33,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-28 20:22:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:22:33,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:33,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:22:33,936 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-11-28 20:22:33,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:33,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452436292] [2019-11-28 20:22:33,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:33,967 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-28 20:22:33,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452436292] [2019-11-28 20:22:33,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:33,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:22:33,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462119204] [2019-11-28 20:22:33,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:33,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:33,970 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2019-11-28 20:22:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:34,014 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-11-28 20:22:34,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:34,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:22:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:34,016 INFO L225 Difference]: With dead ends: 20 [2019-11-28 20:22:34,016 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 20:22:34,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-28 20:22:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 20:22:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 20:22:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:22:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-28 20:22:34,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 6 [2019-11-28 20:22:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:34,022 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-28 20:22:34,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-28 20:22:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:22:34,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:34,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:34,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1366846491, now seen corresponding path program 1 times [2019-11-28 20:22:34,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:34,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188232511] [2019-11-28 20:22:34,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,060 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-28 20:22:34,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188232511] [2019-11-28 20:22:34,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:34,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:22:34,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907814828] [2019-11-28 20:22:34,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:34,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:34,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:34,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:34,063 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 3 states. [2019-11-28 20:22:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:34,101 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 20:22:34,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:34,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 20:22:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:34,103 INFO L225 Difference]: With dead ends: 22 [2019-11-28 20:22:34,103 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 20:22:34,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-28 20:22:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 20:22:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 20:22:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:22:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-28 20:22:34,109 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2019-11-28 20:22:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:34,109 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-28 20:22:34,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-28 20:22:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:22:34,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:34,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:34,110 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 577431791, now seen corresponding path program 1 times [2019-11-28 20:22:34,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:34,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184816560] [2019-11-28 20:22:34,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,165 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-28 20:22:34,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184816560] [2019-11-28 20:22:34,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:34,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:22:34,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730337945] [2019-11-28 20:22:34,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:34,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:34,167 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 3 states. [2019-11-28 20:22:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:34,196 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 20:22:34,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:34,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 20:22:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:34,197 INFO L225 Difference]: With dead ends: 22 [2019-11-28 20:22:34,198 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 20:22:34,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-28 20:22:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 20:22:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 20:22:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:22:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-11-28 20:22:34,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2019-11-28 20:22:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:34,206 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-11-28 20:22:34,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-11-28 20:22:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:22:34,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:34,208 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:34,208 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 861171249, now seen corresponding path program 1 times [2019-11-28 20:22:34,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:34,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440280291] [2019-11-28 20:22:34,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,297 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-28 20:22:34,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440280291] [2019-11-28 20:22:34,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220094007] [2019-11-28 20:22:34,300 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-28 20:22:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,346 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:22:34,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:34,458 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-28 20:22:34,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:34,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-11-28 20:22:34,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672737140] [2019-11-28 20:22:34,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:22:34,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:22:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:34,460 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2019-11-28 20:22:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:34,613 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-28 20:22:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:22:34,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-28 20:22:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:34,615 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:22:34,615 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 20:22:34,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:22:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 20:22:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-28 20:22:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:22:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-11-28 20:22:34,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2019-11-28 20:22:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:34,626 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-11-28 20:22:34,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:22:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-11-28 20:22:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:22:34,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:34,627 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:34,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:34,828 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:34,829 INFO L82 PathProgramCache]: Analyzing trace with hash 926504987, now seen corresponding path program 1 times [2019-11-28 20:22:34,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:34,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105461331] [2019-11-28 20:22:34,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,877 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-28 20:22:34,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105461331] [2019-11-28 20:22:34,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377188745] [2019-11-28 20:22:34,878 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-28 20:22:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:34,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:22:34,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:34,947 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-28 20:22:34,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:34,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-11-28 20:22:34,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527828500] [2019-11-28 20:22:34,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:34,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:34,950 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2019-11-28 20:22:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:35,054 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-11-28 20:22:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:22:35,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 20:22:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:35,055 INFO L225 Difference]: With dead ends: 29 [2019-11-28 20:22:35,055 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 20:22:35,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 20:22:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-11-28 20:22:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:22:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-11-28 20:22:35,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2019-11-28 20:22:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:35,066 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-11-28 20:22:35,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-11-28 20:22:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:22:35,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:35,068 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:35,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:35,272 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1343116429, now seen corresponding path program 1 times [2019-11-28 20:22:35,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:35,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853351161] [2019-11-28 20:22:35,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:35,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853351161] [2019-11-28 20:22:35,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847058338] [2019-11-28 20:22:35,324 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-28 20:22:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:35,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:35,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:35,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:35,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:22:35,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984048775] [2019-11-28 20:22:35,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:35,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:35,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:35,368 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 5 states. [2019-11-28 20:22:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:35,444 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-28 20:22:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:22:35,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:22:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:35,445 INFO L225 Difference]: With dead ends: 24 [2019-11-28 20:22:35,445 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 20:22:35,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 20:22:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 20:22:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:22:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-11-28 20:22:35,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2019-11-28 20:22:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:35,455 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-11-28 20:22:35,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-11-28 20:22:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:22:35,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:35,458 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:22:35,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:35,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1313063709, now seen corresponding path program 1 times [2019-11-28 20:22:35,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:35,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246648178] [2019-11-28 20:22:35,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:35,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246648178] [2019-11-28 20:22:35,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959471718] [2019-11-28 20:22:35,719 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-28 20:22:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:35,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:35,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:35,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:35,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:22:35,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120370939] [2019-11-28 20:22:35,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:35,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:35,749 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2019-11-28 20:22:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:35,874 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-11-28 20:22:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:22:35,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 20:22:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:35,875 INFO L225 Difference]: With dead ends: 35 [2019-11-28 20:22:35,875 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 20:22:35,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 20:22:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-28 20:22:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:22:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-28 20:22:35,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2019-11-28 20:22:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:35,881 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-28 20:22:35,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-28 20:22:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:22:35,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:35,882 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 20:22:36,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:36,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2050269365, now seen corresponding path program 1 times [2019-11-28 20:22:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645688941] [2019-11-28 20:22:36,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645688941] [2019-11-28 20:22:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000468764] [2019-11-28 20:22:36,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:22:36,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:36,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 20:22:36,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525918958] [2019-11-28 20:22:36,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:22:36,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:22:36,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:22:36,171 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-11-28 20:22:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,195 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-11-28 20:22:36,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:36,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 20:22:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,196 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:22:36,196 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 20:22:36,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 20:22:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 20:22:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:22:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 20:22:36,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2019-11-28 20:22:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,201 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 20:22:36,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:22:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 20:22:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:22:36,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,202 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 20:22:36,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:36,411 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 844787553, now seen corresponding path program 2 times [2019-11-28 20:22:36,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779411070] [2019-11-28 20:22:36,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779411070] [2019-11-28 20:22:36,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987340240] [2019-11-28 20:22:36,496 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:36,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:36,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:36,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:22:36,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:36,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-11-28 20:22:36,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734403875] [2019-11-28 20:22:36,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:22:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:22:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:22:36,699 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-11-28 20:22:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,983 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-11-28 20:22:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:22:36,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-28 20:22:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,984 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:22:36,984 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:22:36,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:22:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:22:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-28 20:22:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:22:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-28 20:22:36,989 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2019-11-28 20:22:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,990 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-28 20:22:36,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:22:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-28 20:22:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:22:36,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,991 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 20:22:37,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,198 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash 418610411, now seen corresponding path program 2 times [2019-11-28 20:22:37,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563850506] [2019-11-28 20:22:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:22:37,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563850506] [2019-11-28 20:22:37,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840687821] [2019-11-28 20:22:37,266 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:37,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:37,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:37,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:22:37,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:37,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 20:22:37,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273057922] [2019-11-28 20:22:37,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:22:37,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:22:37,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:22:37,326 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-11-28 20:22:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,370 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 20:22:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:22:37,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 20:22:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,371 INFO L225 Difference]: With dead ends: 28 [2019-11-28 20:22:37,372 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 20:22:37,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 20:22:37,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-28 20:22:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:22:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-28 20:22:37,375 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2019-11-28 20:22:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,376 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-28 20:22:37,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:22:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-28 20:22:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:22:37,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,377 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-11-28 20:22:37,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,584 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1442319379, now seen corresponding path program 2 times [2019-11-28 20:22:37,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72408777] [2019-11-28 20:22:37,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:22:37,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72408777] [2019-11-28 20:22:37,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859377672] [2019-11-28 20:22:37,620 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:22:37,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:37,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:37,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:37,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:37,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 8 [2019-11-28 20:22:37,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319694862] [2019-11-28 20:22:37,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:22:37,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:22:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:37,714 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2019-11-28 20:22:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,788 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 20:22:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:22:37,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 20:22:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,789 INFO L225 Difference]: With dead ends: 26 [2019-11-28 20:22:37,789 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 20:22:37,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:22:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 20:22:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 20:22:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:22:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-28 20:22:37,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-11-28 20:22:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,793 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-28 20:22:37,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:22:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-28 20:22:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:22:37,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,794 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-11-28 20:22:37,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,998 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1141262287, now seen corresponding path program 3 times [2019-11-28 20:22:38,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562053489] [2019-11-28 20:22:38,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:22:38,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562053489] [2019-11-28 20:22:38,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439909894] [2019-11-28 20:22:38,109 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 20:22:38,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:22:38,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:22:38,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:38,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:38,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-11-28 20:22:38,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357800061] [2019-11-28 20:22:38,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:22:38,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:22:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:22:38,307 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 16 states. [2019-11-28 20:22:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,695 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-11-28 20:22:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:22:38,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-11-28 20:22:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,696 INFO L225 Difference]: With dead ends: 28 [2019-11-28 20:22:38,696 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:22:38,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:22:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:22:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:22:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:22:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:22:38,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 20:22:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,698 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:22:38,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:22:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:22:38,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:22:38,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:22:39,005 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-11-28 20:22:39,005 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:22:39,005 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-11-28 20:22:39,006 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-11-28 20:22:39,006 INFO L249 CegarLoopResult]: At program point L27(lines 16 28) the Hoare annotation is: true [2019-11-28 20:22:39,006 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-28 20:22:39,006 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 20:22:39,006 INFO L246 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-28 20:22:39,006 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-28 20:22:39,007 INFO L246 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-11-28 20:22:39,008 INFO L242 CegarLoopResult]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~y~0 100))) (or (and (<= 1 ULTIMATE.start_main_~z~0) (<= ULTIMATE.start_main_~x~0 2147483647) (<= (+ ULTIMATE.start_main_~z~0 99) ULTIMATE.start_main_~y~0) .cse0) (let ((.cse1 (+ ULTIMATE.start_main_~z~0 100))) (and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~y~0 2147483448)) .cse0 (<= 99 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 .cse1) (<= .cse1 ULTIMATE.start_main_~y~0))))) [2019-11-28 20:22:39,008 INFO L246 CegarLoopResult]: For program point L22-3(lines 22 26) no Hoare annotation was computed. [2019-11-28 20:22:39,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:39 BoogieIcfgContainer [2019-11-28 20:22:39,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:22:39,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:22:39,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:22:39,024 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:22:39,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:33" (3/4) ... [2019-11-28 20:22:39,027 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:22:39,036 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:22:39,037 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:22:39,075 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:22:39,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:22:39,078 INFO L168 Benchmark]: Toolchain (without parser) took 6375.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -110.9 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:39,079 INFO L168 Benchmark]: CDTParser took 1.61 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-28 20:22:39,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.97 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:39,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:39,080 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:39,081 INFO L168 Benchmark]: RCFGBuilder took 220.49 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:39,082 INFO L168 Benchmark]: TraceAbstraction took 5744.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.5 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:39,082 INFO L168 Benchmark]: Witness Printer took 51.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:39,086 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.61 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 242.97 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 85.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 220.49 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5744.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.5 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. * Witness Printer took 51.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((1 <= z && x <= 2147483647) && z + 99 <= y) && y <= 100) || ((((x <= y + 2147483448 && y <= 100) && 99 <= y) && y <= z + 100) && z + 100 <= y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. Result: SAFE, OverallTime: 5.5s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 91 SDtfs, 193 SDslu, 52 SDs, 0 SdLazy, 569 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=10, 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, 15 MinimizatonAttempts, 34 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 39 HoareAnnotationTreeSize, 2 FomulaSimplifications, 75 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 124 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 22744 SizeOfPredicates, 6 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 15/176 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...