./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 30f4e4ab 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.24-30f4e4a [2019-11-28 02:49:59,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:49:59,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:49:59,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:49:59,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:49:59,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:49:59,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:49:59,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:49:59,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:49:59,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:49:59,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:49:59,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:49:59,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:49:59,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:49:59,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:49:59,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:49:59,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:49:59,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:49:59,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:49:59,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:49:59,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:49:59,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:49:59,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:49:59,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:49:59,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:49:59,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:49:59,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:49:59,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:49:59,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:49:59,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:49:59,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:49:59,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:49:59,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:49:59,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:49:59,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:49:59,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:49:59,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:49:59,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:49:59,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:49:59,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:49:59,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:49:59,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:49:59,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:49:59,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:49:59,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:49:59,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:49:59,466 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:49:59,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:49:59,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:49:59,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:49:59,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:49:59,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:49:59,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:49:59,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:49:59,468 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:49:59,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:49:59,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:49:59,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:49:59,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:49:59,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:49:59,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:49:59,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:49:59,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:49:59,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:49:59,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:49:59,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:49:59,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:49:59,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:49:59,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:49:59,472 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 02:49:59,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:49:59,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:49:59,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:49:59,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:49:59,803 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:49:59,804 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 02:49:59,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274cd0937/977e9420839d40ef97f87df7bb7900de/FLAG2ffd75181 [2019-11-28 02:50:00,265 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:00,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MenloPark.c [2019-11-28 02:50:00,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274cd0937/977e9420839d40ef97f87df7bb7900de/FLAG2ffd75181 [2019-11-28 02:50:00,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274cd0937/977e9420839d40ef97f87df7bb7900de [2019-11-28 02:50:00,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:00,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:00,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:00,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:00,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:00,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48247ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:00, skipping insertion in model container [2019-11-28 02:50:00,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:00" (1/1) ... [2019-11-28 02:50:00,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:00,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:00,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:00,967 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:00,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:01,007 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:01,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01 WrapperNode [2019-11-28 02:50:01,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:01,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:01,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:01,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:01,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:01,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:01,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:01,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:01,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (1/1) ... [2019-11-28 02:50:01,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:01,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:01,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:01,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:01,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (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 02:50:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:01,371 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:01,372 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:50:01,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:01 BoogieIcfgContainer [2019-11-28 02:50:01,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:01,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:01,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:01,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:01,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:00" (1/3) ... [2019-11-28 02:50:01,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba85633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:01, skipping insertion in model container [2019-11-28 02:50:01,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:01" (2/3) ... [2019-11-28 02:50:01,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba85633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:01, skipping insertion in model container [2019-11-28 02:50:01,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:01" (3/3) ... [2019-11-28 02:50:01,394 INFO L109 eAbstractionObserver]: Analyzing ICFG MenloPark.c [2019-11-28 02:50:01,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:01,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 02:50:01,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 02:50:01,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:01,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:01,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:01,502 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:01,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:01,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:01,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:01,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 02:50:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 02:50:01,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 02:50:01,533 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 02:50:01,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-11-28 02:50:01,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623405561] [2019-11-28 02:50:01,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,756 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 02:50:01,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623405561] [2019-11-28 02:50:01,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:01,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:50:01,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798436856] [2019-11-28 02:50:01,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:01,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:01,776 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-28 02:50:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:01,844 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 02:50:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:01,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 02:50:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:01,855 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:50:01,855 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 02:50:01,859 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 02:50:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 02:50:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 02:50:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 02:50:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-28 02:50:01,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2019-11-28 02:50:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:01,893 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-28 02:50:01,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-28 02:50:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 02:50:01,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:01,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 02:50:01,895 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 02:50:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-11-28 02:50:01,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:01,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124016261] [2019-11-28 02:50:01,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:01,944 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 02:50:01,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124016261] [2019-11-28 02:50:01,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:01,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:01,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224747436] [2019-11-28 02:50:01,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:01,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:01,948 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2019-11-28 02:50:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,009 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 02:50:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:02,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-28 02:50:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,011 INFO L225 Difference]: With dead ends: 22 [2019-11-28 02:50:02,011 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 02:50:02,013 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 02:50:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 02:50:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-28 02:50:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 02:50:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-28 02:50:02,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2019-11-28 02:50:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,021 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-28 02:50:02,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-28 02:50:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:02,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:02,023 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 02:50:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash 29862563, now seen corresponding path program 1 times [2019-11-28 02:50:02,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861310517] [2019-11-28 02:50:02,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,058 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 02:50:02,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861310517] [2019-11-28 02:50:02,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:02,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:50:02,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269911926] [2019-11-28 02:50:02,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:02,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:02,064 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-11-28 02:50:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,114 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-11-28 02:50:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:02,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 02:50:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,116 INFO L225 Difference]: With dead ends: 20 [2019-11-28 02:50:02,116 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 02:50:02,116 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 02:50:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 02:50:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 02:50:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:50:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-28 02:50:02,122 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2019-11-28 02:50:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,123 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-28 02:50:02,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-28 02:50:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:02,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,124 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 02:50:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-11-28 02:50:02,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215930284] [2019-11-28 02:50:02,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,152 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 02:50:02,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215930284] [2019-11-28 02:50:02,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:02,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:50:02,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206693882] [2019-11-28 02:50:02,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:02,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:02,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:02,155 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2019-11-28 02:50:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,197 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-11-28 02:50:02,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:02,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:50:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,199 INFO L225 Difference]: With dead ends: 20 [2019-11-28 02:50:02,199 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 02:50:02,200 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 02:50:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 02:50:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 02:50:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 02:50:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-28 02:50:02,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 6 [2019-11-28 02:50:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,207 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-28 02:50:02,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-28 02:50:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:50:02,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,209 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 02:50:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1366846491, now seen corresponding path program 1 times [2019-11-28 02:50:02,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278739709] [2019-11-28 02:50:02,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,254 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 02:50:02,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278739709] [2019-11-28 02:50:02,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:02,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:50:02,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117807874] [2019-11-28 02:50:02,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:02,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:02,257 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 3 states. [2019-11-28 02:50:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,290 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 02:50:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:02,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 02:50:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,292 INFO L225 Difference]: With dead ends: 22 [2019-11-28 02:50:02,292 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 02:50:02,293 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 02:50:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 02:50:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 02:50:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 02:50:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-28 02:50:02,298 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2019-11-28 02:50:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,298 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-28 02:50:02,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-28 02:50:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:50:02,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,300 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 02:50:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,300 INFO L82 PathProgramCache]: Analyzing trace with hash 577431791, now seen corresponding path program 1 times [2019-11-28 02:50:02,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013130610] [2019-11-28 02:50:02,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,331 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 02:50:02,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013130610] [2019-11-28 02:50:02,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:02,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:50:02,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320608814] [2019-11-28 02:50:02,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:02,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:02,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:02,335 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 3 states. [2019-11-28 02:50:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,369 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 02:50:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:02,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 02:50:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,370 INFO L225 Difference]: With dead ends: 22 [2019-11-28 02:50:02,371 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 02:50:02,373 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 02:50:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 02:50:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 02:50:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:50:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-11-28 02:50:02,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2019-11-28 02:50:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,383 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-11-28 02:50:02,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-11-28 02:50:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:50:02,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,386 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,387 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 02:50:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash 861171249, now seen corresponding path program 1 times [2019-11-28 02:50:02,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432411460] [2019-11-28 02:50:02,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,466 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 02:50:02,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432411460] [2019-11-28 02:50:02,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289654787] [2019-11-28 02:50:02,467 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 02:50:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:02,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:50:02,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:02,608 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 02:50:02,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:02,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-11-28 02:50:02,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558841684] [2019-11-28 02:50:02,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:50:02,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:02,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:50:02,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:02,617 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2019-11-28 02:50:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:02,778 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-28 02:50:02,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:02,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-28 02:50:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:02,779 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:50:02,780 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 02:50:02,780 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 02:50:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 02:50:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-28 02:50:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 02:50:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-11-28 02:50:02,791 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2019-11-28 02:50:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:02,792 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-11-28 02:50:02,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:50:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-11-28 02:50:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:50:02,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:02,794 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:02,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:02,995 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 02:50:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash 926504987, now seen corresponding path program 1 times [2019-11-28 02:50:02,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:02,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113388180] [2019-11-28 02:50:02,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,060 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 02:50:03,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113388180] [2019-11-28 02:50:03,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961387601] [2019-11-28 02:50:03,061 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 02:50:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:50:03,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:03,145 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 02:50:03,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:03,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-11-28 02:50:03,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520751024] [2019-11-28 02:50:03,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:03,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:03,148 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2019-11-28 02:50:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:03,256 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-11-28 02:50:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:03,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 02:50:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:03,258 INFO L225 Difference]: With dead ends: 29 [2019-11-28 02:50:03,258 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 02:50:03,258 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 02:50:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 02:50:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-11-28 02:50:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:50:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-11-28 02:50:03,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2019-11-28 02:50:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:03,265 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-11-28 02:50:03,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-11-28 02:50:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:50:03,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:03,266 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:03,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:03,473 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 02:50:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1343116429, now seen corresponding path program 1 times [2019-11-28 02:50:03,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:03,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204198134] [2019-11-28 02:50:03,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,533 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 02:50:03,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204198134] [2019-11-28 02:50:03,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509789230] [2019-11-28 02:50:03,534 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 02:50:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:03,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:03,566 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 02:50:03,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:03,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:50:03,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676929088] [2019-11-28 02:50:03,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:03,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:03,569 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 5 states. [2019-11-28 02:50:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:03,666 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-28 02:50:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:03,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:50:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:03,668 INFO L225 Difference]: With dead ends: 24 [2019-11-28 02:50:03,668 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 02:50:03,669 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 02:50:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 02:50:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 02:50:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 02:50:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-11-28 02:50:03,681 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2019-11-28 02:50:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:03,681 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-11-28 02:50:03,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-11-28 02:50:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:50:03,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:03,683 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:50:03,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:03,884 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 02:50:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1313063709, now seen corresponding path program 1 times [2019-11-28 02:50:03,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:03,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109973228] [2019-11-28 02:50:03,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,935 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 02:50:03,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109973228] [2019-11-28 02:50:03,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32889287] [2019-11-28 02:50:03,936 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 02:50:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:03,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:03,977 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 02:50:03,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:03,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 02:50:03,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831215599] [2019-11-28 02:50:03,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:03,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:03,980 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2019-11-28 02:50:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:04,080 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-11-28 02:50:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:50:04,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 02:50:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:04,082 INFO L225 Difference]: With dead ends: 35 [2019-11-28 02:50:04,082 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 02:50:04,083 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 02:50:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 02:50:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-28 02:50:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:50:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-28 02:50:04,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2019-11-28 02:50:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:04,094 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-28 02:50:04,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-28 02:50:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:50:04,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:04,096 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 02:50:04,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:04,297 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 02:50:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2050269365, now seen corresponding path program 1 times [2019-11-28 02:50:04,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837983979] [2019-11-28 02:50:04,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,342 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 02:50:04,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837983979] [2019-11-28 02:50:04,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035877727] [2019-11-28 02:50:04,343 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 02:50:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:50:04,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:04,369 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 02:50:04,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:04,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 02:50:04,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97388060] [2019-11-28 02:50:04,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:04,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:04,372 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-11-28 02:50:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:04,398 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-11-28 02:50:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:04,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:50:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:04,400 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:50:04,400 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 02:50:04,401 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 02:50:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 02:50:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 02:50:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:50:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 02:50:04,408 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2019-11-28 02:50:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:04,408 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 02:50:04,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 02:50:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:50:04,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:04,410 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 02:50:04,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:04,616 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 02:50:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash 844787553, now seen corresponding path program 2 times [2019-11-28 02:50:04,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138717080] [2019-11-28 02:50:04,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,691 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 02:50:04,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138717080] [2019-11-28 02:50:04,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838069037] [2019-11-28 02:50:04,692 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 02:50:04,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:04,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:04,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:50:04,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:04,878 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 02:50:04,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:04,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-11-28 02:50:04,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191652587] [2019-11-28 02:50:04,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:50:04,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:50:04,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:04,881 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-11-28 02:50:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,231 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-11-28 02:50:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 02:50:05,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-28 02:50:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,233 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:50:05,233 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:50:05,234 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 02:50:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:50:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-28 02:50:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:50:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-28 02:50:05,239 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2019-11-28 02:50:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,239 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-28 02:50:05,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:50:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-28 02:50:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:50:05,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,241 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 02:50:05,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:05,444 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 02:50:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash 418610411, now seen corresponding path program 2 times [2019-11-28 02:50:05,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222486276] [2019-11-28 02:50:05,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,530 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 02:50:05,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222486276] [2019-11-28 02:50:05,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709355925] [2019-11-28 02:50:05,531 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 02:50:05,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:05,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:05,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:05,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:05,596 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 02:50:05,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:05,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 02:50:05,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636629914] [2019-11-28 02:50:05,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:05,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:05,599 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-11-28 02:50:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,651 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 02:50:05,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:05,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 02:50:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,653 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:50:05,653 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 02:50:05,653 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 02:50:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 02:50:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-28 02:50:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:50:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-28 02:50:05,659 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2019-11-28 02:50:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,661 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-28 02:50:05,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-28 02:50:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:50:05,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,662 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-11-28 02:50:05,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:05,867 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 02:50:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1442319379, now seen corresponding path program 2 times [2019-11-28 02:50:05,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892726519] [2019-11-28 02:50:05,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,906 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 02:50:05,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892726519] [2019-11-28 02:50:05,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438638882] [2019-11-28 02:50:05,906 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 02:50:05,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:05,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:05,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:05,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:06,008 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 02:50:06,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:06,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 8 [2019-11-28 02:50:06,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958081309] [2019-11-28 02:50:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:50:06,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:50:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:06,011 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2019-11-28 02:50:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,091 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 02:50:06,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:06,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 02:50:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,092 INFO L225 Difference]: With dead ends: 26 [2019-11-28 02:50:06,092 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:50:06,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:50:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:50:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 02:50:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:50:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-28 02:50:06,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-11-28 02:50:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,096 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-28 02:50:06,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:50:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-28 02:50:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:50:06,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,096 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-11-28 02:50:06,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:06,297 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 02:50:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1141262287, now seen corresponding path program 3 times [2019-11-28 02:50:06,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471043926] [2019-11-28 02:50:06,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,373 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 02:50:06,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471043926] [2019-11-28 02:50:06,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457266605] [2019-11-28 02:50:06,374 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 02:50:06,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 02:50:06,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:06,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:50:06,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:06,526 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 02:50:06,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:06,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-11-28 02:50:06,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626631085] [2019-11-28 02:50:06,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 02:50:06,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 02:50:06,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:50:06,528 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 16 states. [2019-11-28 02:50:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,897 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-11-28 02:50:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:50:06,897 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-11-28 02:50:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,898 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:50:06,898 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:06,899 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 02:50:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:06,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 02:50:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,900 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:06,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 02:50:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:06,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:07,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:07,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:07,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-11-28 02:50:07,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:07,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-11-28 02:50:07,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L249 CegarLoopResult]: At program point L27(lines 16 28) the Hoare annotation is: true [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:07,211 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-11-28 02:50:07,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:07,212 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-28 02:50:07,212 INFO L246 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-11-28 02:50:07,212 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 02:50:07,213 INFO L246 CegarLoopResult]: For program point L22-3(lines 22 26) no Hoare annotation was computed. [2019-11-28 02:50:07,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:07 BoogieIcfgContainer [2019-11-28 02:50:07,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:07,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:07,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:07,231 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:07,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:01" (3/4) ... [2019-11-28 02:50:07,235 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:07,246 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:50:07,247 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:07,294 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:07,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:07,297 INFO L168 Benchmark]: Toolchain (without parser) took 6606.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -84.5 MB). Peak memory consumption was 109.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,297 INFO L168 Benchmark]: CDTParser took 1.44 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 02:50:07,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,300 INFO L168 Benchmark]: Boogie Preprocessor took 28.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,300 INFO L168 Benchmark]: RCFGBuilder took 245.18 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.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,301 INFO L168 Benchmark]: TraceAbstraction took 5852.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,302 INFO L168 Benchmark]: Witness Printer took 63.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,305 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.44 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 315.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.18 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.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5852.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. * Witness Printer took 63.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. 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.6s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 1.7s, 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.3s 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.1s 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.1s 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...