./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-numeric/java_LogBuiltIn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-numeric/java_LogBuiltIn_true-termination_true-no-overflow.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 d28857c86a3c83fc75b1b8cf8125f1c52a370911 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:50:20,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:50:20,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:50:20,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:50:20,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:50:20,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:50:20,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:50:20,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:50:20,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:50:20,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:50:20,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:50:20,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:50:20,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:50:20,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:50:20,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:50:20,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:50:20,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:50:20,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:50:20,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:50:20,499 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:50:20,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:50:20,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:50:20,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:50:20,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:50:20,505 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:50:20,506 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:50:20,507 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:50:20,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:50:20,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:50:20,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:50:20,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:50:20,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:50:20,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:50:20,512 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:50:20,513 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:50:20,513 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:50:20,514 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:50:20,529 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:50:20,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:50:20,531 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:50:20,531 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:50:20,531 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:50:20,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:50:20,532 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:50:20,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:50:20,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:50:20,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:50:20,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:50:20,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:50:20,533 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:50:20,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:50:20,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:50:20,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:50:20,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:50:20,534 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:50:20,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:50:20,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:50:20,534 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:50:20,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:50:20,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:50:20,535 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:50:20,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:50:20,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:50:20,536 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> d28857c86a3c83fc75b1b8cf8125f1c52a370911 [2019-01-14 21:50:20,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:50:20,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:50:20,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:50:20,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:50:20,601 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:50:20,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/java_LogBuiltIn_true-termination_true-no-overflow.c [2019-01-14 21:50:20,670 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfbb68e6/3c989ef16e4741628fc11e264f94116e/FLAG6aabe9e4a [2019-01-14 21:50:21,081 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:50:21,081 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/java_LogBuiltIn_true-termination_true-no-overflow.c [2019-01-14 21:50:21,086 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfbb68e6/3c989ef16e4741628fc11e264f94116e/FLAG6aabe9e4a [2019-01-14 21:50:21,450 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfbb68e6/3c989ef16e4741628fc11e264f94116e [2019-01-14 21:50:21,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:50:21,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:50:21,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:50:21,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:50:21,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:50:21,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf23058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21, skipping insertion in model container [2019-01-14 21:50:21,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:50:21,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:50:21,689 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:50:21,694 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:50:21,710 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:50:21,727 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:50:21,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21 WrapperNode [2019-01-14 21:50:21,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:50:21,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:50:21,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:50:21,731 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:50:21,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:50:21,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:50:21,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:50:21,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:50:21,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (1/1) ... [2019-01-14 21:50:21,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:50:21,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:50:21,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:50:21,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:50:21,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (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-01-14 21:50:21,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:50:21,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:50:22,130 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:50:22,130 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 21:50:22,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:50:22 BoogieIcfgContainer [2019-01-14 21:50:22,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:50:22,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:50:22,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:50:22,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:50:22,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:50:21" (1/3) ... [2019-01-14 21:50:22,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4eec29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:50:22, skipping insertion in model container [2019-01-14 21:50:22,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:50:21" (2/3) ... [2019-01-14 21:50:22,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4eec29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:50:22, skipping insertion in model container [2019-01-14 21:50:22,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:50:22" (3/3) ... [2019-01-14 21:50:22,139 INFO L112 eAbstractionObserver]: Analyzing ICFG java_LogBuiltIn_true-termination_true-no-overflow.c [2019-01-14 21:50:22,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:50:22,156 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:50:22,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:50:22,200 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:50:22,201 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:50:22,201 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:50:22,201 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:50:22,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:50:22,202 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:50:22,202 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:50:22,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:50:22,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:50:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-14 21:50:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 21:50:22,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:22,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 21:50:22,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:22,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-14 21:50:22,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:22,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:22,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:50:22,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:50:22,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:50:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:50:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:50:22,544 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-01-14 21:50:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:22,595 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-14 21:50:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:50:22,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-14 21:50:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:22,606 INFO L225 Difference]: With dead ends: 20 [2019-01-14 21:50:22,606 INFO L226 Difference]: Without dead ends: 8 [2019-01-14 21:50:22,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:50:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-14 21:50:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 21:50:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 21:50:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-14 21:50:22,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 3 [2019-01-14 21:50:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:22,638 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-14 21:50:22,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:50:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-14 21:50:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:50:22,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:22,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:50:22,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash 29862563, now seen corresponding path program 1 times [2019-01-14 21:50:22,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:22,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:22,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:50:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:50:22,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:50:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:50:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:50:22,686 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-01-14 21:50:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:22,770 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-14 21:50:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:50:22,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 21:50:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:22,771 INFO L225 Difference]: With dead ends: 15 [2019-01-14 21:50:22,771 INFO L226 Difference]: Without dead ends: 14 [2019-01-14 21:50:22,773 INFO L631 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-01-14 21:50:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-14 21:50:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-14 21:50:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 21:50:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-14 21:50:22,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 5 [2019-01-14 21:50:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:22,777 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-14 21:50:22,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:50:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-14 21:50:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:50:22,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:22,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:50:22,779 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-01-14 21:50:22,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:22,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:50:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:50:22,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:50:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:50:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:50:22,857 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-01-14 21:50:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:22,902 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-14 21:50:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:50:22,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-14 21:50:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:22,905 INFO L225 Difference]: With dead ends: 12 [2019-01-14 21:50:22,905 INFO L226 Difference]: Without dead ends: 11 [2019-01-14 21:50:22,906 INFO L631 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-01-14 21:50:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-14 21:50:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 21:50:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 21:50:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-14 21:50:22,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2019-01-14 21:50:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:22,910 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-14 21:50:22,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:50:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-14 21:50:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:50:22,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:22,911 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 21:50:22,913 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash 860863857, now seen corresponding path program 1 times [2019-01-14 21:50:22,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:22,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:22,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:23,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:23,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:23,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:23,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:50:23,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:50:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:50:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:50:23,192 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2019-01-14 21:50:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:23,433 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-14 21:50:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:50:23,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-14 21:50:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:23,434 INFO L225 Difference]: With dead ends: 18 [2019-01-14 21:50:23,434 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 21:50:23,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:50:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 21:50:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 21:50:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 21:50:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-14 21:50:23,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-14 21:50:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-14 21:50:23,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:50:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-14 21:50:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 21:50:23,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:23,442 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-14 21:50:23,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:23,443 INFO L82 PathProgramCache]: Analyzing trace with hash -846644381, now seen corresponding path program 2 times [2019-01-14 21:50:23,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:23,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:23,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:23,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:23,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:23,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:50:23,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:50:23,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:23,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:23,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:23,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:50:23,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:50:23,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:50:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:50:23,722 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2019-01-14 21:50:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:23,949 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-14 21:50:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:50:23,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 21:50:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:23,951 INFO L225 Difference]: With dead ends: 23 [2019-01-14 21:50:23,951 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 21:50:23,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:50:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 21:50:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-14 21:50:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 21:50:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-14 21:50:23,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-14 21:50:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:23,958 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-14 21:50:23,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:50:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-14 21:50:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:50:23,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:23,959 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-14 21:50:23,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1716869967, now seen corresponding path program 3 times [2019-01-14 21:50:23,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:23,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:24,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:24,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:24,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:50:24,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:50:24,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:24,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:24,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:24,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:50:24,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:50:24,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:50:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:50:24,265 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2019-01-14 21:50:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:24,736 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-14 21:50:24,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:50:24,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-14 21:50:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:24,739 INFO L225 Difference]: With dead ends: 28 [2019-01-14 21:50:24,740 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 21:50:24,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:50:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 21:50:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 21:50:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 21:50:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-14 21:50:24,745 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-14 21:50:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:24,745 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-14 21:50:24,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:50:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-14 21:50:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 21:50:24,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:24,747 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-14 21:50:24,747 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -333652957, now seen corresponding path program 4 times [2019-01-14 21:50:24,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:24,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:24,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:24,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:24,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:24,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:50:25,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:50:25,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:25,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:25,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:25,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:50:25,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:50:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:50:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:50:25,051 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 12 states. [2019-01-14 21:50:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:25,258 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-14 21:50:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:50:25,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-01-14 21:50:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:25,262 INFO L225 Difference]: With dead ends: 33 [2019-01-14 21:50:25,262 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 21:50:25,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:50:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 21:50:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-14 21:50:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 21:50:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-14 21:50:25,268 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-14 21:50:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:25,269 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-14 21:50:25,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:50:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-14 21:50:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 21:50:25,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:25,270 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-14 21:50:25,270 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash -302154767, now seen corresponding path program 5 times [2019-01-14 21:50:25,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:25,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:25,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:25,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:25,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:25,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:25,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:25,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:50:25,583 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 21:50:25,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:25,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:25,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:25,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 21:50:25,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 21:50:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 21:50:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:50:25,627 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 14 states. [2019-01-14 21:50:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:25,847 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-14 21:50:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 21:50:25,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-01-14 21:50:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:25,850 INFO L225 Difference]: With dead ends: 38 [2019-01-14 21:50:25,850 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 21:50:25,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:50:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 21:50:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-14 21:50:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 21:50:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-14 21:50:25,857 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-14 21:50:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:25,857 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-14 21:50:25,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 21:50:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-14 21:50:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 21:50:25,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:25,858 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-14 21:50:25,859 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash -902918941, now seen corresponding path program 6 times [2019-01-14 21:50:25,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:25,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:25,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:26,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:26,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:26,121 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:50:26,198 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 21:50:26,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:26,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:26,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:26,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 21:50:26,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 21:50:26,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 21:50:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 21:50:26,237 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 16 states. [2019-01-14 21:50:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:26,925 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-14 21:50:26,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 21:50:26,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-01-14 21:50:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:26,929 INFO L225 Difference]: With dead ends: 43 [2019-01-14 21:50:26,929 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 21:50:26,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:50:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 21:50:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-01-14 21:50:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 21:50:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-14 21:50:26,938 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-14 21:50:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:26,938 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-14 21:50:26,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 21:50:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-14 21:50:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 21:50:26,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:26,941 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-14 21:50:26,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash -820231375, now seen corresponding path program 7 times [2019-01-14 21:50:26,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:26,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:27,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:27,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:27,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:27,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:27,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:27,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 21:50:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 21:50:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 21:50:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:50:27,396 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-01-14 21:50:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:27,655 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-14 21:50:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 21:50:27,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-01-14 21:50:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:27,657 INFO L225 Difference]: With dead ends: 48 [2019-01-14 21:50:27,657 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 21:50:27,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:50:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 21:50:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-14 21:50:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 21:50:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-14 21:50:27,665 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-14 21:50:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:27,666 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-14 21:50:27,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 21:50:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-14 21:50:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 21:50:27,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:27,669 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-14 21:50:27,669 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:27,669 INFO L82 PathProgramCache]: Analyzing trace with hash -311800413, now seen corresponding path program 8 times [2019-01-14 21:50:27,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:27,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:27,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:28,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:28,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:28,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:50:28,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:50:28,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:28,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:28,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:28,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-14 21:50:28,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 21:50:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 21:50:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:50:28,307 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 20 states. [2019-01-14 21:50:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:28,558 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-14 21:50:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:50:28,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2019-01-14 21:50:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:28,561 INFO L225 Difference]: With dead ends: 53 [2019-01-14 21:50:28,561 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 21:50:28,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2019-01-14 21:50:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 21:50:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-01-14 21:50:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 21:50:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-14 21:50:28,569 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-14 21:50:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:28,569 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-14 21:50:28,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 21:50:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-14 21:50:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 21:50:28,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:28,571 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-14 21:50:28,571 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:28,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:28,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1658518129, now seen corresponding path program 9 times [2019-01-14 21:50:28,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:28,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:28,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:29,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:29,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:29,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:50:29,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 21:50:29,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:29,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:29,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:29,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-14 21:50:29,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 21:50:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 21:50:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 21:50:29,459 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 22 states. [2019-01-14 21:50:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:29,774 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-14 21:50:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 21:50:29,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2019-01-14 21:50:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:29,776 INFO L225 Difference]: With dead ends: 58 [2019-01-14 21:50:29,777 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 21:50:29,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=686, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:50:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 21:50:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-14 21:50:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 21:50:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-14 21:50:29,783 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-14 21:50:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:29,784 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-14 21:50:29,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 21:50:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-14 21:50:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 21:50:29,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:29,787 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-14 21:50:29,787 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1266934173, now seen corresponding path program 10 times [2019-01-14 21:50:29,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:29,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:29,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:30,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:30,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:50:30,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:50:30,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:30,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:30,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:30,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-14 21:50:30,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 21:50:30,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 21:50:30,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:50:30,281 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 24 states. [2019-01-14 21:50:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:30,565 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-14 21:50:30,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 21:50:30,567 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2019-01-14 21:50:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:30,568 INFO L225 Difference]: With dead ends: 63 [2019-01-14 21:50:30,569 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 21:50:30,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 21:50:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 21:50:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-14 21:50:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 21:50:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-14 21:50:30,576 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-14 21:50:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:30,576 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-14 21:50:30,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 21:50:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-14 21:50:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 21:50:30,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:30,578 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-14 21:50:30,580 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1777491535, now seen corresponding path program 11 times [2019-01-14 21:50:30,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:30,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:31,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:31,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:50:31,070 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-14 21:50:31,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:31,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:31,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:31,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-14 21:50:31,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 21:50:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 21:50:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:50:31,120 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 26 states. [2019-01-14 21:50:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:31,581 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-14 21:50:31,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 21:50:31,582 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2019-01-14 21:50:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:31,583 INFO L225 Difference]: With dead ends: 68 [2019-01-14 21:50:31,583 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 21:50:31,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=427, Invalid=979, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:50:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 21:50:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-14 21:50:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 21:50:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-14 21:50:31,590 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-14 21:50:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:31,590 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-14 21:50:31,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 21:50:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-14 21:50:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 21:50:31,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:31,591 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-14 21:50:31,592 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:31,592 INFO L82 PathProgramCache]: Analyzing trace with hash 386924323, now seen corresponding path program 12 times [2019-01-14 21:50:31,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:31,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:31,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:32,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:32,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:32,035 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:50:32,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-14 21:50:32,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:32,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:32,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:32,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-14 21:50:32,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 21:50:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 21:50:32,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 21:50:32,126 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 28 states. [2019-01-14 21:50:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:32,474 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-14 21:50:32,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 21:50:32,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2019-01-14 21:50:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:32,476 INFO L225 Difference]: With dead ends: 73 [2019-01-14 21:50:32,476 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 21:50:32,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=495, Invalid=1145, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 21:50:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 21:50:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-01-14 21:50:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 21:50:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-14 21:50:32,484 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-14 21:50:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:32,484 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-14 21:50:32,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 21:50:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-14 21:50:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 21:50:32,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:32,487 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-14 21:50:32,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1552431345, now seen corresponding path program 13 times [2019-01-14 21:50:32,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:32,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:32,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:32,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:32,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:32,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:32,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:32,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-14 21:50:32,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 21:50:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 21:50:32,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 21:50:32,978 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 30 states. [2019-01-14 21:50:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:33,368 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-14 21:50:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 21:50:33,369 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2019-01-14 21:50:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:33,370 INFO L225 Difference]: With dead ends: 78 [2019-01-14 21:50:33,370 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 21:50:33,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=568, Invalid=1324, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:50:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 21:50:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-14 21:50:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 21:50:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-14 21:50:33,385 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-14 21:50:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:33,385 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-14 21:50:33,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 21:50:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-14 21:50:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-14 21:50:33,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:33,392 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-14 21:50:33,392 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1708257251, now seen corresponding path program 14 times [2019-01-14 21:50:33,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:33,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:33,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:34,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:34,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:34,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:50:34,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:50:34,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:34,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:34,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:34,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-01-14 21:50:34,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 21:50:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 21:50:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:50:34,168 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 32 states. [2019-01-14 21:50:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:34,839 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-14 21:50:34,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 21:50:34,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 75 [2019-01-14 21:50:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:34,842 INFO L225 Difference]: With dead ends: 83 [2019-01-14 21:50:34,842 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 21:50:34,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=646, Invalid=1516, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 21:50:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 21:50:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-14 21:50:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 21:50:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-14 21:50:34,850 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-14 21:50:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:34,850 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-14 21:50:34,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 21:50:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-14 21:50:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-14 21:50:34,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:34,853 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-14 21:50:34,853 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash -249642959, now seen corresponding path program 15 times [2019-01-14 21:50:34,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:34,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:35,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:35,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:50:35,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 21:50:35,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:35,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:35,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:35,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-14 21:50:35,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 21:50:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 21:50:35,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:50:35,622 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 34 states. [2019-01-14 21:50:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:36,404 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-14 21:50:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 21:50:36,405 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 80 [2019-01-14 21:50:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:36,406 INFO L225 Difference]: With dead ends: 88 [2019-01-14 21:50:36,406 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 21:50:36,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=729, Invalid=1721, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:50:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 21:50:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-01-14 21:50:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 21:50:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-14 21:50:36,412 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-14 21:50:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:36,413 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-14 21:50:36,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 21:50:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-14 21:50:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-14 21:50:36,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:36,415 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-14 21:50:36,415 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 174977187, now seen corresponding path program 16 times [2019-01-14 21:50:36,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:36,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:36,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:36,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:36,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:50:36,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:50:36,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:36,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:37,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:37,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-14 21:50:37,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 21:50:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 21:50:37,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:50:37,047 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 36 states. [2019-01-14 21:50:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:37,562 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-14 21:50:37,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 21:50:37,564 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2019-01-14 21:50:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:37,565 INFO L225 Difference]: With dead ends: 93 [2019-01-14 21:50:37,565 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 21:50:37,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=817, Invalid=1939, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 21:50:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 21:50:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-01-14 21:50:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 21:50:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-14 21:50:37,570 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-14 21:50:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:37,571 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-14 21:50:37,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 21:50:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-14 21:50:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 21:50:37,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:37,572 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-14 21:50:37,572 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:37,572 INFO L82 PathProgramCache]: Analyzing trace with hash 363149169, now seen corresponding path program 17 times [2019-01-14 21:50:37,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:37,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:37,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:39,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:39,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:50:39,507 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-14 21:50:39,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:39,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:39,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:39,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-14 21:50:39,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 21:50:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 21:50:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:50:39,551 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 38 states. [2019-01-14 21:50:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:40,041 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-14 21:50:40,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 21:50:40,042 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 90 [2019-01-14 21:50:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:40,042 INFO L225 Difference]: With dead ends: 98 [2019-01-14 21:50:40,043 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 21:50:40,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=910, Invalid=2170, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 21:50:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 21:50:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-01-14 21:50:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 21:50:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-14 21:50:40,049 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-14 21:50:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:40,049 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-14 21:50:40,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 21:50:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-14 21:50:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 21:50:40,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:40,053 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-14 21:50:40,053 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1200619875, now seen corresponding path program 18 times [2019-01-14 21:50:40,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:40,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:40,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:41,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:41,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:50:41,407 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-14 21:50:41,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:41,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:41,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:41,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-14 21:50:41,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 21:50:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 21:50:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 21:50:41,465 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 40 states. [2019-01-14 21:50:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:42,045 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-14 21:50:42,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 21:50:42,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 95 [2019-01-14 21:50:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:42,048 INFO L225 Difference]: With dead ends: 103 [2019-01-14 21:50:42,049 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 21:50:42,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1008, Invalid=2414, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 21:50:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 21:50:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-01-14 21:50:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 21:50:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-14 21:50:42,054 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-14 21:50:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:42,055 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-14 21:50:42,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 21:50:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-14 21:50:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 21:50:42,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:42,057 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-14 21:50:42,057 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1391435441, now seen corresponding path program 19 times [2019-01-14 21:50:42,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:42,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:42,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:43,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:43,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:43,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:43,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:43,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:43,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-14 21:50:43,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 21:50:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 21:50:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 21:50:43,306 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 42 states. [2019-01-14 21:50:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:43,804 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-14 21:50:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 21:50:43,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 100 [2019-01-14 21:50:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:43,808 INFO L225 Difference]: With dead ends: 108 [2019-01-14 21:50:43,808 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 21:50:43,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1111, Invalid=2671, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 21:50:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 21:50:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-14 21:50:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 21:50:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-14 21:50:43,813 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-14 21:50:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:43,813 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-14 21:50:43,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 21:50:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-14 21:50:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 21:50:43,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:43,814 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-14 21:50:43,814 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -119266781, now seen corresponding path program 20 times [2019-01-14 21:50:43,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:43,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:45,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:45,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:45,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:50:45,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:50:45,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:45,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:45,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:45,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-14 21:50:45,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 21:50:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 21:50:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:50:45,256 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 44 states. [2019-01-14 21:50:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:45,919 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-14 21:50:45,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 21:50:45,923 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 105 [2019-01-14 21:50:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:45,924 INFO L225 Difference]: With dead ends: 113 [2019-01-14 21:50:45,924 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 21:50:45,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1219, Invalid=2941, Unknown=0, NotChecked=0, Total=4160 [2019-01-14 21:50:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 21:50:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-01-14 21:50:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 21:50:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-14 21:50:45,932 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-14 21:50:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:45,933 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-14 21:50:45,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 21:50:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-14 21:50:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-14 21:50:45,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:45,936 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-14 21:50:45,937 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash 953284081, now seen corresponding path program 21 times [2019-01-14 21:50:45,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:45,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:45,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:46,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:46,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:50:46,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 21:50:46,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:46,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:46,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:46,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-14 21:50:46,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 21:50:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 21:50:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 21:50:46,860 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 46 states. [2019-01-14 21:50:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:47,473 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-14 21:50:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 21:50:47,474 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 110 [2019-01-14 21:50:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:47,476 INFO L225 Difference]: With dead ends: 118 [2019-01-14 21:50:47,476 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 21:50:47,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1332, Invalid=3224, Unknown=0, NotChecked=0, Total=4556 [2019-01-14 21:50:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 21:50:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-01-14 21:50:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 21:50:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-14 21:50:47,482 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-14 21:50:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:47,482 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-14 21:50:47,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 21:50:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-14 21:50:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 21:50:47,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:47,486 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-14 21:50:47,486 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1393971939, now seen corresponding path program 22 times [2019-01-14 21:50:47,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:47,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:48,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:48,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:50:48,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:50:48,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:48,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:48,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:48,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-14 21:50:48,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 21:50:48,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 21:50:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 21:50:48,356 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 48 states. [2019-01-14 21:50:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:49,079 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-01-14 21:50:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 21:50:49,080 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 115 [2019-01-14 21:50:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:49,082 INFO L225 Difference]: With dead ends: 123 [2019-01-14 21:50:49,082 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 21:50:49,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1450, Invalid=3520, Unknown=0, NotChecked=0, Total=4970 [2019-01-14 21:50:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 21:50:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-14 21:50:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 21:50:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-14 21:50:49,089 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-14 21:50:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:49,089 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-14 21:50:49,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 21:50:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-14 21:50:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-14 21:50:49,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:49,092 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-14 21:50:49,092 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1642054351, now seen corresponding path program 23 times [2019-01-14 21:50:49,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:49,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:49,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:49,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:51,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:51,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:50:51,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-14 21:50:51,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:51,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-14 21:50:51,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 21:50:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 21:50:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:50:51,383 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 50 states. [2019-01-14 21:50:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:52,019 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-01-14 21:50:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 21:50:52,020 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 120 [2019-01-14 21:50:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:52,022 INFO L225 Difference]: With dead ends: 128 [2019-01-14 21:50:52,022 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 21:50:52,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1573, Invalid=3829, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 21:50:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 21:50:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-14 21:50:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 21:50:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-14 21:50:52,028 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-14 21:50:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:52,028 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-14 21:50:52,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 21:50:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-14 21:50:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-14 21:50:52,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:52,029 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-14 21:50:52,031 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1546480733, now seen corresponding path program 24 times [2019-01-14 21:50:52,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:52,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:52,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:52,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:53,001 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:50:53,112 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-01-14 21:50:53,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:53,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:53,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:53,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-14 21:50:53,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 21:50:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 21:50:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 21:50:53,166 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 52 states. [2019-01-14 21:50:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:53,864 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-01-14 21:50:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-14 21:50:53,865 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 125 [2019-01-14 21:50:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:53,867 INFO L225 Difference]: With dead ends: 133 [2019-01-14 21:50:53,867 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 21:50:53,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=4151, Unknown=0, NotChecked=0, Total=5852 [2019-01-14 21:50:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 21:50:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-01-14 21:50:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-14 21:50:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-14 21:50:53,872 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-14 21:50:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:53,873 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-14 21:50:53,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 21:50:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-14 21:50:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-14 21:50:53,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:53,873 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-14 21:50:53,874 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash -525437839, now seen corresponding path program 25 times [2019-01-14 21:50:53,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:53,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:53,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:54,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:54,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:54,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-14 21:50:54,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 21:50:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 21:50:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 21:50:54,879 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 54 states. [2019-01-14 21:50:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:55,917 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-01-14 21:50:55,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-14 21:50:55,919 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 130 [2019-01-14 21:50:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:55,921 INFO L225 Difference]: With dead ends: 138 [2019-01-14 21:50:55,921 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 21:50:55,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1834, Invalid=4486, Unknown=0, NotChecked=0, Total=6320 [2019-01-14 21:50:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 21:50:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-14 21:50:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-14 21:50:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-14 21:50:55,928 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-14 21:50:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:55,928 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-14 21:50:55,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 21:50:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-14 21:50:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-14 21:50:55,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:55,929 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-14 21:50:55,929 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash 298116195, now seen corresponding path program 26 times [2019-01-14 21:50:55,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:55,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:50:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:57,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:57,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:50:57,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:50:57,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:57,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:57,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-01-14 21:50:57,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-14 21:50:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-14 21:50:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 21:50:57,136 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 56 states. [2019-01-14 21:50:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:50:57,994 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-01-14 21:50:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-14 21:50:57,995 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 135 [2019-01-14 21:50:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:50:57,996 INFO L225 Difference]: With dead ends: 143 [2019-01-14 21:50:57,996 INFO L226 Difference]: Without dead ends: 142 [2019-01-14 21:50:57,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1972, Invalid=4834, Unknown=0, NotChecked=0, Total=6806 [2019-01-14 21:50:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-14 21:50:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-01-14 21:50:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-14 21:50:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-14 21:50:58,007 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-14 21:50:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:50:58,007 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-14 21:50:58,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-14 21:50:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-14 21:50:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-14 21:50:58,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:50:58,011 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-14 21:50:58,013 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:50:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:50:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 626039729, now seen corresponding path program 27 times [2019-01-14 21:50:58,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:50:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:50:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:58,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:50:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:50:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:50:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:59,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:50:59,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:50:59,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:50:59,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-14 21:50:59,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:50:59,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:50:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:50:59,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:50:59,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-01-14 21:50:59,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 21:50:59,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 21:50:59,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 21:50:59,308 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 58 states. [2019-01-14 21:51:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:00,186 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-01-14 21:51:00,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-14 21:51:00,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 140 [2019-01-14 21:51:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:00,189 INFO L225 Difference]: With dead ends: 148 [2019-01-14 21:51:00,189 INFO L226 Difference]: Without dead ends: 147 [2019-01-14 21:51:00,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2115, Invalid=5195, Unknown=0, NotChecked=0, Total=7310 [2019-01-14 21:51:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-14 21:51:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-01-14 21:51:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 21:51:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-14 21:51:00,195 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-14 21:51:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:00,195 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-14 21:51:00,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 21:51:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-14 21:51:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-14 21:51:00,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:00,199 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-14 21:51:00,199 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1553548579, now seen corresponding path program 28 times [2019-01-14 21:51:00,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:00,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:00,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:01,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:01,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:01,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:51:01,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:51:01,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:01,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:01,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:01,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-01-14 21:51:01,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 21:51:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 21:51:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 21:51:01,925 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 60 states. [2019-01-14 21:51:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:03,153 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-01-14 21:51:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-14 21:51:03,155 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 145 [2019-01-14 21:51:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:03,157 INFO L225 Difference]: With dead ends: 153 [2019-01-14 21:51:03,157 INFO L226 Difference]: Without dead ends: 152 [2019-01-14 21:51:03,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2263, Invalid=5569, Unknown=0, NotChecked=0, Total=7832 [2019-01-14 21:51:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-14 21:51:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-01-14 21:51:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-14 21:51:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-14 21:51:03,184 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-14 21:51:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:03,185 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-14 21:51:03,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 21:51:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-14 21:51:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-14 21:51:03,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:03,189 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-14 21:51:03,190 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1747275023, now seen corresponding path program 29 times [2019-01-14 21:51:03,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:03,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:03,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:03,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:04,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:51:04,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:51:04,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:51:04,689 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-01-14 21:51:04,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:51:04,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:51:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:04,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:51:04,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-01-14 21:51:04,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 21:51:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 21:51:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 21:51:04,751 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 62 states. [2019-01-14 21:51:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:05,838 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-01-14 21:51:05,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-14 21:51:05,839 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 150 [2019-01-14 21:51:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:05,841 INFO L225 Difference]: With dead ends: 158 [2019-01-14 21:51:05,841 INFO L226 Difference]: Without dead ends: 157 [2019-01-14 21:51:05,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2416, Invalid=5956, Unknown=0, NotChecked=0, Total=8372 [2019-01-14 21:51:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-14 21:51:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-01-14 21:51:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-14 21:51:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-14 21:51:05,847 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-14 21:51:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:05,847 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-14 21:51:05,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 21:51:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-14 21:51:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-14 21:51:05,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:51:05,848 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-14 21:51:05,848 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:51:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:51:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1661225501, now seen corresponding path program 30 times [2019-01-14 21:51:05,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:51:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:51:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:05,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:51:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:51:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:51:08,837 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 21:51:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 2295 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:51:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:51:09,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2019-01-14 21:51:09,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-14 21:51:09,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-14 21:51:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2913, Invalid=5643, Unknown=0, NotChecked=0, Total=8556 [2019-01-14 21:51:09,792 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 93 states. [2019-01-14 21:51:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:51:10,195 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-01-14 21:51:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-14 21:51:10,196 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 155 [2019-01-14 21:51:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:51:10,197 INFO L225 Difference]: With dead ends: 158 [2019-01-14 21:51:10,197 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:51:10,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3104 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2976, Invalid=5766, Unknown=0, NotChecked=0, Total=8742 [2019-01-14 21:51:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:51:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:51:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:51:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:51:10,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2019-01-14 21:51:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:51:10,200 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:51:10,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-14 21:51:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:51:10,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:51:10,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:51:10,994 WARN L181 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 155 [2019-01-14 21:51:11,013 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:51:11,014 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 9) no Hoare annotation was computed. [2019-01-14 21:51:11,014 INFO L444 ceAbstractionStarter]: At program point L19(lines 18 20) the Hoare annotation is: (<= ULTIMATE.start_mlog_~x 2147483647) [2019-01-14 21:51:11,014 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 10) no Hoare annotation was computed. [2019-01-14 21:51:11,014 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-01-14 21:51:11,014 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-01-14 21:51:11,015 INFO L444 ceAbstractionStarter]: At program point L7-2(lines 7 12) the Hoare annotation is: (let ((.cse0 (< 0 (+ ULTIMATE.start_mlog_~x 1))) (.cse2 (div ULTIMATE.start_mlog_~x 2)) (.cse1 (<= 0 ULTIMATE.start_mlog_~res~0))) (or (and (<= ULTIMATE.start_mlog_~res~0 19) .cse0 .cse1 (<= .cse2 2047)) (and (<= ULTIMATE.start_mlog_~res~0 13) .cse0 (<= .cse2 131071) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 1) .cse0 .cse1 (<= .cse2 536870911)) (and .cse0 .cse1 (<= ULTIMATE.start_mlog_~res~0 14) (<= .cse2 65535)) (and (<= ULTIMATE.start_mlog_~res~0 16) .cse0 (<= .cse2 16383) .cse1) (and .cse0 (<= ULTIMATE.start_mlog_~x 1) .cse1) (and (<= .cse2 4095) .cse0 (<= ULTIMATE.start_mlog_~res~0 18) .cse1) (and (<= .cse2 8191) (<= ULTIMATE.start_mlog_~res~0 17) .cse0 .cse1) (and (<= ULTIMATE.start_mlog_~res~0 5) .cse0 .cse1 (<= .cse2 33554431)) (and .cse0 (<= ULTIMATE.start_mlog_~res~0 12) (<= .cse2 262143) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 2) .cse0 (<= .cse2 268435455) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 15) .cse0 .cse1 (<= .cse2 32767)) (and .cse0 (<= ULTIMATE.start_mlog_~res~0 6) .cse1 (<= .cse2 16777215)) (and (<= ULTIMATE.start_mlog_~res~0 4) .cse0 (<= .cse2 67108863) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 20) .cse0 (<= .cse2 1023) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 28) .cse0 (<= .cse2 3) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 10) .cse0 .cse1 (<= .cse2 1048575)) (and (<= ULTIMATE.start_mlog_~res~0 29) .cse0 .cse1 (<= .cse2 1)) (and (<= ULTIMATE.start_mlog_~res~0 9) (<= .cse2 2097151) .cse0 .cse1) (and (<= .cse2 511) .cse0 .cse1 (<= ULTIMATE.start_mlog_~res~0 21)) (and .cse0 (<= .cse2 4194303) (<= ULTIMATE.start_mlog_~res~0 8) .cse1) (and (<= ULTIMATE.start_mlog_~res~0 24) .cse0 .cse1 (<= .cse2 63)) (and .cse0 .cse1 (<= .cse2 31) (<= ULTIMATE.start_mlog_~res~0 25)) (and (<= ULTIMATE.start_mlog_~res~0 7) .cse0 .cse1 (<= .cse2 8388607)) (and .cse0 (<= .cse2 134217727) .cse1 (<= ULTIMATE.start_mlog_~res~0 3)) (and (<= ULTIMATE.start_mlog_~res~0 26) (<= .cse2 15) .cse0 .cse1) (and .cse1 (<= ULTIMATE.start_mlog_~res~0 0) (<= ULTIMATE.start_mlog_~x 2147483647)) (and .cse0 (<= .cse2 524287) .cse1 (<= ULTIMATE.start_mlog_~res~0 11)) (and (<= ULTIMATE.start_mlog_~res~0 22) .cse0 (<= .cse2 255) .cse1) (and .cse0 (<= .cse2 127) .cse1 (<= ULTIMATE.start_mlog_~res~0 23)) (and (<= ULTIMATE.start_mlog_~res~0 27) .cse0 (<= .cse2 7) .cse1))) [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 9) no Hoare annotation was computed. [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point L7-3(lines 7 12) no Hoare annotation was computed. [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 10) no Hoare annotation was computed. [2019-01-14 21:51:11,016 INFO L444 ceAbstractionStarter]: At program point L14(lines 3 16) the Hoare annotation is: (<= ULTIMATE.start_mlog_~x 2147483647) [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-01-14 21:51:11,016 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-01-14 21:51:11,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:51:11 BoogieIcfgContainer [2019-01-14 21:51:11,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:51:11,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:51:11,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:51:11,041 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:51:11,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:50:22" (3/4) ... [2019-01-14 21:51:11,048 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:51:11,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 21:51:11,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:51:11,117 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:51:11,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:51:11,119 INFO L168 Benchmark]: Toolchain (without parser) took 49664.80 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 534.8 MB). Free memory was 951.3 MB in the beginning and 864.0 MB in the end (delta: 87.3 MB). Peak memory consumption was 622.1 MB. Max. memory is 11.5 GB. [2019-01-14 21:51:11,121 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:51:11,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.80 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:51:11,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.60 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:51:11,122 INFO L168 Benchmark]: Boogie Preprocessor took 28.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:51:11,122 INFO L168 Benchmark]: RCFGBuilder took 331.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 21:51:11,127 INFO L168 Benchmark]: TraceAbstraction took 48907.63 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 420.0 MB). Free memory was 1.1 GB in the beginning and 864.2 MB in the end (delta: 225.4 MB). Peak memory consumption was 645.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:51:11,129 INFO L168 Benchmark]: Witness Printer took 77.56 ms. Allocated memory is still 1.6 GB. Free memory was 864.2 MB in the beginning and 864.0 MB in the end (delta: 156.1 kB). Peak memory consumption was 156.1 kB. Max. memory is 11.5 GB. [2019-01-14 21:51:11,133 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.80 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.60 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 331.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48907.63 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 420.0 MB). Free memory was 1.1 GB in the beginning and 864.2 MB in the end (delta: 225.4 MB). Peak memory consumption was 645.4 MB. Max. memory is 11.5 GB. * Witness Printer took 77.56 ms. Allocated memory is still 1.6 GB. Free memory was 864.2 MB in the beginning and 864.0 MB in the end (delta: 156.1 kB). Peak memory consumption was 156.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((res <= 19 && 0 < x + 1) && 0 <= res) && x / 2 <= 2047) || (((res <= 13 && 0 < x + 1) && x / 2 <= 131071) && 0 <= res)) || (((res <= 1 && 0 < x + 1) && 0 <= res) && x / 2 <= 536870911)) || (((0 < x + 1 && 0 <= res) && res <= 14) && x / 2 <= 65535)) || (((res <= 16 && 0 < x + 1) && x / 2 <= 16383) && 0 <= res)) || ((0 < x + 1 && x <= 1) && 0 <= res)) || (((x / 2 <= 4095 && 0 < x + 1) && res <= 18) && 0 <= res)) || (((x / 2 <= 8191 && res <= 17) && 0 < x + 1) && 0 <= res)) || (((res <= 5 && 0 < x + 1) && 0 <= res) && x / 2 <= 33554431)) || (((0 < x + 1 && res <= 12) && x / 2 <= 262143) && 0 <= res)) || (((res <= 2 && 0 < x + 1) && x / 2 <= 268435455) && 0 <= res)) || (((res <= 15 && 0 < x + 1) && 0 <= res) && x / 2 <= 32767)) || (((0 < x + 1 && res <= 6) && 0 <= res) && x / 2 <= 16777215)) || (((res <= 4 && 0 < x + 1) && x / 2 <= 67108863) && 0 <= res)) || (((res <= 20 && 0 < x + 1) && x / 2 <= 1023) && 0 <= res)) || (((res <= 28 && 0 < x + 1) && x / 2 <= 3) && 0 <= res)) || (((res <= 10 && 0 < x + 1) && 0 <= res) && x / 2 <= 1048575)) || (((res <= 29 && 0 < x + 1) && 0 <= res) && x / 2 <= 1)) || (((res <= 9 && x / 2 <= 2097151) && 0 < x + 1) && 0 <= res)) || (((x / 2 <= 511 && 0 < x + 1) && 0 <= res) && res <= 21)) || (((0 < x + 1 && x / 2 <= 4194303) && res <= 8) && 0 <= res)) || (((res <= 24 && 0 < x + 1) && 0 <= res) && x / 2 <= 63)) || (((0 < x + 1 && 0 <= res) && x / 2 <= 31) && res <= 25)) || (((res <= 7 && 0 < x + 1) && 0 <= res) && x / 2 <= 8388607)) || (((0 < x + 1 && x / 2 <= 134217727) && 0 <= res) && res <= 3)) || (((res <= 26 && x / 2 <= 15) && 0 < x + 1) && 0 <= res)) || ((0 <= res && res <= 0) && x <= 2147483647)) || (((0 < x + 1 && x / 2 <= 524287) && 0 <= res) && res <= 11)) || (((res <= 22 && 0 < x + 1) && x / 2 <= 255) && 0 <= res)) || (((0 < x + 1 && x / 2 <= 127) && 0 <= res) && res <= 23)) || (((res <= 27 && 0 < x + 1) && x / 2 <= 7) && 0 <= res) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. SAFE Result, 48.8s OverallTime, 33 OverallIterations, 31 TraceHistogramMax, 17.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 1779 SDslu, 2293 SDs, 0 SdLazy, 3823 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3784 GetRequests, 2292 SyntacticMatches, 0 SemanticMatches, 1492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16154 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 31 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 522 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 4809 NumberOfCodeBlocks, 4809 NumberOfCodeBlocksAsserted, 292 NumberOfCheckSat, 4747 ConstructedInterpolants, 0 QuantifiedInterpolants, 1516241 SizeOfPredicates, 464 NumberOfNonLiveVariables, 5307 ConjunctsInSsa, 957 ConjunctsInUnsatCore, 62 InterpolantComputations, 4 PerfectInterpolantSequences, 2295/46375 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...